Bounds on the eigenvalues of graphs with cut vertices or edges

DOI10.1016/j.laa.2010.12.012zbMath1216.05082OpenAlexW1997613961MaRDI QIDQ630554

Bao-Xuan Zhu

Publication date: 17 March 2011

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

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

zbMATH Keywords

Laplacianleast eigenvaluesignless Laplacian spectral radiuscut verticescut edges

Mathematics Subject Classification ID

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

Related Items

Bound on the least eigenvalue of a graph with cut vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Signless Laplacians of finite graphs
• Graphs for which the least eigenvalue is minimal. I
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• Graphs for which the least eigenvalue is minimal. II.
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• The least eigenvalue of a graph with cut vertices
• On the signless Laplacian spectral radius of graphs with cut vertices
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• Laplacian matrices of graphs: A survey
• Properties of spectra of graphs and line graphs
• On the spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges
• The Laplacian spectral radius of some bipartite graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• The Laplacian Spectrum of a Graph
• Towards a spectral theory of graphs based on the signless Laplacian, I
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones

This page was built for publication: Bounds on the eigenvalues of graphs with cut vertices or edges