Bound on the least eigenvalue of a graph with cut vertices

DOI10.1080/03081087.2014.914509zbMath1307.05154OpenAlexW2066326095MaRDI QIDQ5175374

Bao-Xuan Zhu

Publication date: 20 February 2015

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

Full work available at URL: https://doi.org/10.1080/03081087.2014.914509

zbMATH Keywords

spectral radiusleast eigenvaluecut vertices

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Further results on the least eigenvalue of connected graphs
• The least eigenvalue of the complements of trees
• Bounds on the eigenvalues of graphs with cut vertices or edges
• Spectral radius of graphs with given matching number
• 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.
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
• The least eigenvalue of a graph with cut vertices
• On the signless Laplacian spectral radius of graphs with cut vertices
• Bicyclic graphs for which the least eigenvalue is minimum
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• The spectral radius of trees on \(k\) pendant vertices
• On the spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges

This page was built for publication: Bound on the least eigenvalue of a graph with cut vertices