A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo

DOI10.1016/j.laa.2008.06.008zbMath1144.05315WikidataQ123308689 ScholiaQ123308689MaRDI QIDQ947676

Willem H. Haemers, Andries E. Brouwer

Publication date: 6 October 2008

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

Full work available at URL: https://doi.org/10.1016/j.laa.2008.06.008

zbMATH Keywords

graphs; Laplacian eigenvalues

Mathematics Subject Classification ID

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

05C07: Vertex degrees

Related Items

Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues, Upper bounds on the (signless) Laplacian eigenvalues of graphs, Upper bounds for the sum of Laplacian eigenvalues of graphs, Graphs with given diameter maximizing the algebraic connectivity, Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs, Graphs with four distinct Laplacian eigenvalues, Partial characterization of graphs having a single large Laplacian eigenvalue, On the sum of Laplacian eigenvalues of graphs, On a lower bound for the Laplacian eigenvalues of a graph, Power-law partial correlation network models, Laplacian energy of diameter 3 trees, Deleting vertices and interlacing Laplacian eigenvalues, On the sum of the Laplacian eigenvalues of a tree, A majorization method for localizing graph topological indices

Cites Work

• Interlacing eigenvalues and graphs
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• On the third largest Laplacian eigenvalue of a graph
• The Laplacian Spectrum of a Graph II