The least eigenvalue of graphs with cut edges

DOI10.1007/s00373-011-1060-zzbMath1256.05144OpenAlexW2048638019MaRDI QIDQ1926031

Yi Wang, Yi-Zheng Fan

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1060-z

zbMATH Keywords

adjacency matrixleast eigenvaluecut edge

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (2)

Unnamed Item ⋮ Graphs with least eigenvalue \(-2\): ten years on

Cites Work

• Unnamed Item
• 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.
• The least eigenvalue of a graph 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
• On the spectral radius of (0,1)-matrices
• Sharp lower bounds of the least eigenvalue of planar graphs
• On the spectral radius of graphs with cut edges
• The largest eigenvalue of a graph: A survey

This page was built for publication: The least eigenvalue of graphs with cut edges