On the third largest Laplacian eigenvalue of a graph

DOI10.1080/03081080600730996zbMath1111.05061OpenAlexW2043875784MaRDI QIDQ3422763

Ji-Ming Guo

Publication date: 14 February 2007

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

Full work available at URL: https://doi.org/10.1080/03081080600730996

zbMATH Keywords

characteristic polynomialdegreelower boundLaplacian matrix

Mathematics Subject Classification ID

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

Related Items (8)

Classification of graphs by Laplacian eigenvalue distribution and independence number ⋮ On a lower bound for the Laplacian eigenvalues of a graph ⋮ Deleting vertices and interlacing Laplacian eigenvalues ⋮ Laplacian eigenvalue distribution of a graph with given independence number ⋮ On the distribution of Laplacian eigenvalues of a graph ⋮ Partial characterization of graphs having a single large Laplacian eigenvalue ⋮ Spectral properties of Pascal graphs ⋮ A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo

Cites Work

• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• The Laplacian Spectrum of a Graph II

This page was built for publication: On the third largest Laplacian eigenvalue of a graph