A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
From MaRDI portal
Publication:947676
DOI10.1016/j.laa.2008.06.008zbMath1144.05315OpenAlexW2089820643WikidataQ123308689 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
Related Items
The Laplacian energy of diameter 4 trees, Graphs with given diameter maximizing the algebraic connectivity, Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues, Upper bounds on the (signless) Laplacian eigenvalues of graphs, On a conjecture of Laplacian energy of trees, Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs, Upper bounds for the sum of Laplacian eigenvalues of graphs, On a lower bound for the Laplacian eigenvalues of a graph, Determination of particular double starlike trees by the Laplacian spectrum, Laplacian energy of diameter 3 trees, Deleting vertices and interlacing Laplacian eigenvalues, On the sum of the Laplacian eigenvalues of a tree, Graphs with four distinct Laplacian eigenvalues, A majorization method for localizing graph topological indices, On the Ky Fan $k$-norm of the $LI$-matrix of graphs, Partial characterization of graphs having a single large Laplacian eigenvalue, On the sum of Laplacian eigenvalues of graphs, Power-law partial correlation network models, Trees with a large Laplacian eigenvalue multiplicity, Unnamed Item
Cites Work