Graphs and their spectra

J. J. Seidel

Displaying similar documents to “Graphs and their spectra”

Line Graphs with Exactly two Positive Eigenvalues

Bojana Borovićanin (2002)

Publications de l'Institut Mathématique

Similarity:

On Graphs Whose Second Largest Eigenvalue Does Not Exceed 1

Dragoš Cvetković (1982)

Publications de l'Institut Mathématique

Similarity:

On the Largest Eigenvalue of Unicyclic Graphs

Slobodan K. Simić (1987)

Publications de l'Institut Mathématique

Similarity:

Unicyclic graphs with the strong reciprocal eigenvalue property.

Barik, S., Nath, M., Pati, S., Sarma, B.K. (2008)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic

Yi Wang, Yi-Zheng Fan, Xiao-Xin Li, Fei-Fei Zhang (2015)

Discussiones Mathematicae Graph Theory

Similarity:

A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n/2 ). In this paper we discuss the minimizing graphs of a special class of graphs of order n whose complements are connected and...

'3in1' enhanced: three squared ways to '3in1' GRAPHS

Zdzisław Skupień (2007)

Discussiones Mathematicae Graph Theory

Similarity:

A note on intersecting graphs.

Bretto, A. (1999)

Southwest Journal of Pure and Applied Mathematics [electronic only]

Similarity:

Chord graphs - new means for representing graphs

W. Wessel (1987)

Applicationes Mathematicae

Similarity: