Bound on the least eigenvalue of a graph with cut vertices

DOI10.1080/03081087.2014.914509MaRDI QIDQ5175374zbMATH OpenOpenAlexFDO

Authors 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

cut verticesleast eigenvaluespectral radius

Mathematics Subject Classification ID

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

Recommendations

• The least eigenvalue of a graph with cut vertices
• Bounds on the eigenvalues of graphs with cut vertices or edges
• On the least eigenvalue of graphs with cut vertices
• The least eigenvalue of graphs
• Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))

Cites work

• Bicyclic graphs for which the least eigenvalue is minimum
• Bounds on the eigenvalues of graphs with cut vertices or edges
• Further results on the least eigenvalue of connected graphs
• Graph theory with applications
• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• On the signless Laplacian spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges
• On the spectral radius of graphs with cut vertices
• Spectral radius of graphs with given matching number
• The least eigenvalue of a graph with cut vertices
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of the complements of trees
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• The spectral radius of trees on \(k\) pendant vertices

Cited in

(8)

• Tighter spectral bounds for the cut size, based on Laplacian eigenvectors
• Max k-cut and the smallest eigenvalue
• On the least eigenvalue of graphs with cut vertices
• Location of the eigenvalues of weighted graphs with a cut edge
• Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
• Bounds on the eigenvalues of graphs with cut vertices or edges
• The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
• The least eigenvalue of a graph with cut vertices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175374)