Bounds on the eigenvalues of graphs with cut vertices or edges

DOI10.1016/J.LAA.2010.12.012MaRDI QIDQ630554zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Bound on the least eigenvalue of a graph with cut vertices
• The least eigenvalue of a graph with cut vertices
• On the spectral radius of graphs with cut edges
• The Laplacian spectral radius of some bipartite graphs
• On the spectral radius of graphs with cut vertices

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• Graph theory
• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• Laplacian matrices of graphs: A survey
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• 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
• Properties of spectra of graphs and line graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Signless Laplacians of finite graphs
• The Laplacian Spectrum of a Graph
• The Laplacian spectral radius of some bipartite graphs
• The least eigenvalue of a graph with cut vertices
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• Towards a spectral theory of graphs based on the signless Laplacian. I
• Towards a spectral theory of graphs based on the signless Laplacian. II.

Cited in

(10)

• The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
• Tighter spectral bounds for the cut size, based on Laplacian eigenvectors
• Max \(k\)-cut and the smallest eigenvalue
• scientific article; zbMATH DE number 4063128 (Why is no real title available?)
• Location of the eigenvalues of weighted graphs with a cut edge
• Some results on the largest and least eigenvalues of graphs
• Cut ratios and Laplacian eigenvalues
• The least eigenvalue of a graph with cut vertices
• On graphs with cut vertices and cut edges
• Bound on the least eigenvalue of a graph with cut vertices

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

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