Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius

DOI10.1016/j.laa.2004.11.019zbMath1063.05098OpenAlexW2156411981MaRDI QIDQ1779266

Mei Lu, Feng Tian, Ai-Mei Yu

Publication date: 1 June 2005

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.11.019

zbMATH Keywords

Laplacian matrixSpectral radiusDegree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (6)

Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size ⋮ Proof of conjectures involving algebraic connectivity of graphs ⋮ On the conjecture for certain Laplacian integral spectrum of graphs ⋮ The Laplacian spectral radius for unicyclic graphs with given independence number ⋮ Laplacian and signless Laplacian spectral radii of graphs with fixed domination number ⋮ Bounds for the Laplacian spectral radius of graphs

Cites Work

• An improved upper bound for Laplacian graph eigenvalues
• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
• An always nontrivial upper bound for Laplacian graph eigenvalues
• Eigenvalues of the Laplacian of a graph^∗

This page was built for publication: Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius