On graphs with small number of Laplacian eigenvalues greater than two

DOI10.1016/S0024-3795(02)00458-5zbMath1015.05048MaRDI QIDQ1863532

Jiong-Sheng Li, Yi-Zheng Fan

Publication date: 11 March 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

diameteradjacency matrixmatching number

Mathematics Subject Classification ID

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

Related Items (5)

Nonsingular mixed graphs with few eigenvalues greater than two ⋮ On graphs with exactly three \(Q\)-eigenvalues at least two ⋮ Signless Laplacian eigenvalues and circumference of graphs ⋮ On graphs with at most three Laplacian eigenvalues greater than or equal to two. ⋮ On the eigenvalue two and matching number of a tree

Cites Work

• Unnamed Item
• Laplacian graph eigenvectors
• Laplacian matrices of graphs: A survey
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• The Laplacian Spectrum of a Graph
• Eigenvalues of the Laplacian of a graph^∗
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• A relation between the matching number and Laplacian spectrum of a graph

This page was built for publication: On graphs with small number of Laplacian eigenvalues greater than two