Graphs with Least Eigenvalue at Least -sqrt(3)
Dragoš Cvetković, Dragan Stevanović (2003)
Publications de l'Institut Mathématique
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Laplacian of graphs and algebraic connectivity”
Graphs with Least Eigenvalue at Least -sqrt(3)
Complementary Pairs of Graphs With the Second Largest Eigenvalue not Exceeding (sqrt(5)-1)/2
Slobodan K. Simić (1995)
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:
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:
Graphs and their spectra
J. J. Seidel (1989)
Banach Center Publications
Similarity:
Star Complements and Maximal Exceptional Graphs
P. Rowlinson (2004)
Publications de l'Institut Mathématique
Similarity:
Signed graphs with at most three eigenvalues
Farzaneh Ramezani, Peter Rowlinson, Zoran Stanić (2022)
Czechoslovak Mathematical Journal
Similarity:
We investigate signed graphs with just 2 or 3 distinct eigenvalues, mostly in the context of vertex-deleted subgraphs, the join of two signed graphs or association schemes.