Sharp lower bounds on the Laplacian eigenvalues of trees
From MaRDI portal
Publication:1827487
DOI10.1016/j.laa.2004.01.012zbMath1047.05027OpenAlexW2087268502MaRDI QIDQ1827487
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
Related Items (19)
Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs ⋮ Characterization of graphs having extremal Randić indices ⋮ On the multiplicity of Laplacian eigenvalues for unicyclic graphs ⋮ Theorems on partitioned matrices revisited and their applications to graph spectra ⋮ Riordan graphs. II: Spectral properties ⋮ Upper bounds on the (signless) Laplacian eigenvalues of graphs ⋮ Bounds for the largest \(p\)-Laplacian eigenvalue for graphs ⋮ Laplacian eigenvalue distribution of a graph with given independence number ⋮ On the bounds for the largest Laplacian eigenvalues of weighted graphs ⋮ Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution ⋮ On the conjecture for certain Laplacian integral spectrum of graphs ⋮ On the Laplacian spectral radii of Halin graphs ⋮ On conjectures involving second largest signless Laplacian eigenvalue of graphs ⋮ The Laplacian spectrum of a graph ⋮ Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs ⋮ On energy and Laplacian energy of chain graphs ⋮ Network synchronizability analysis: A graph-theoretic approach ⋮ A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs ⋮ Bounds for the Laplacian spectral radius of graphs
Cites Work
This page was built for publication: Sharp lower bounds on the Laplacian eigenvalues of trees