On the distribution of eigenvalues of graphs

DOI10.1016/S0012-365X(98)00337-9zbMath0971.05076MaRDI QIDQ1297457

Alexander K. Kelmans, Xue-rong Yong

Publication date: 30 October 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesadjacency matrixLaplacianspectra

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

On graphs with three distinct Laplacian eigenvalues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs with exactly one eigenvalue less than -1
• Comparison of graphs by their number of spanning trees
• A certain polynomial of a graph and graphs with an extremal number of trees
• The distribution of eigenvalues of graphs
• Laplacian spectra and spanning trees of threshold graphs
• Graphs characterized by the second eigenvalue
• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees

This page was built for publication: On the distribution of eigenvalues of graphs