The least eigenvalue of a graph with cut vertices

DOI10.1016/j.laa.2010.01.030zbMath1189.05107OpenAlexW2011106299MaRDI QIDQ972775

Yi Wang, Yi-Zheng Fan

Publication date: 21 May 2010

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.01.030

zbMATH Keywords

graphspectral radiusadjacency matrixleast eigenvaluecut vertex

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75)

Related Items

Unnamed Item ⋮ Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) ⋮ The least eigenvalue of graphs with cut edges ⋮ On the least eigenvalue of cacti with pendant vertices ⋮ Bounds on the eigenvalues of graphs with cut vertices or edges ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ On least eigenvalues of bicyclic graphs with fixed number of pendant vertices ⋮ The least eigenvalue of a graph with a given domination number ⋮ Bound on the least eigenvalue of a graph with cut vertices ⋮ The least eigenvalue of the complements of trees ⋮ The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph ⋮ The least eigenvalue of graphs whose complements have only two pendent vertices ⋮ The least eigenvalue of graphs whose complements are unicyclic

Cites Work

• Unnamed Item
• 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.
• 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 vertices
• The largest eigenvalue of a graph: A survey