Sharp lower bounds on the Laplacian eigenvalues of trees

DOI10.1016/J.LAA.2004.01.012zbMATH Open1047.05027OpenAlexW2087268502MaRDI QIDQ1827487FDOQ1827487

Authors: Kinkar Ch. Das 

Publication date: 6 August 2004

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

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

Recommendations

• Sharp bounds on the eigenvalues of trees
• On the second largest Laplacian eigenvalue of trees
• Sharp lower bounds on the eigenvalues of trees
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Sharp bound of the \(k\)th eigenvalue of trees

zbMATH Keywords

treeLaplacian matrixlargest eigenvaluesecond largest eigenvalue

Mathematics Subject Classification ID

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

Cites Work

• The Laplacian Spectrum of a Graph II
• On the Laplacian spectral radius of a tree.
• An improved upper bound for Laplacian graph eigenvalues
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree

Cited In (26)

• Hook immanantal inequalities for trees explained
• Theorems on partitioned matrices revisited and their applications to graph spectra
• Upper bounds on the (signless) Laplacian eigenvalues of graphs
• Sharp bounds on the eigenvalues of trees
• Network synchronizability analysis: a graph-theoretic approach
• Bounds for the Laplacian spectral radius of graphs
• Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
• Minimizing the Laplacian eigenvalues for trees with given domination number
• Laplacian eigenvalue distribution of a graph with given independence number
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
• On the distribution of Laplacian eigenvalues of trees
• On the bounds for the largest Laplacian eigenvalues of weighted graphs
• Characterization of graphs having extremal Randić indices
• Bounds for the largest \(p\)-Laplacian eigenvalue for graphs
• Sharp lower bounds on the eigenvalues of trees
• On energy and Laplacian energy of chain graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Riordan graphs. II: Spectral properties
• An improved spectral lower bound of treewidth
• On the conjecture for certain Laplacian integral spectrum of graphs
• Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs
• The Laplacian spectrum of a graph
• A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
• On the multiplicity of Laplacian eigenvalues for unicyclic graphs
• On the Laplacian spectral radii of Halin graphs

This page was built for publication: Sharp lower bounds on the Laplacian eigenvalues of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827487)