Bounds on the eigenvalues of graphs with cut vertices or edges

DOI10.1016/J.LAA.2010.12.012zbMATH Open1216.05082OpenAlexW1997613961MaRDI QIDQ630554FDOQ630554

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

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

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)

Cites Work

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

Cited In (5)

• Tighter spectral bounds for the cut size, based on Laplacian eigenvectors
• The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
• Title not available (Why is that?)
• Location of the eigenvalues of weighted graphs with a cut edge
• 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)