Sharp lower bounds on the Laplacian eigenvalues of trees

DOI10.1016/J.LAA.2004.01.012MaRDI QIDQ1827487zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

treeLaplacian matrixlargest eigenvaluesecond largest eigenvalue

Mathematics Subject Classification ID

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

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 kth eigenvalue of trees

Cites work

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

Cited in

(26)

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