The least eigenvalue of a graph with cut vertices

DOI10.1016/J.LAA.2010.01.030MaRDI QIDQ972775zbMATH OpenOpenAlexFDO

Authors Yi Wang, Yizheng 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)

Recommendations

• Bound on 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
• Graphs for which the least eigenvalue is minimal. I

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 2117218 (Why is no real title available?)
• Bicyclic graphs for which the least eigenvalue is minimum
• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• On the spectral radius of (0,1)-matrices
• On the spectral radius of graphs with cut vertices
• Sharp lower bounds of the least eigenvalue of planar graphs
• The largest eigenvalue of a graph: A survey
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices

Cited in

(20)

• On the least eigenvalue of cacti with pendant vertices
• On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
• On the least eigenvalue of graphs with matching number two
• The least eigenvalue of graphs whose complements have only two pendent vertices
• Extremal octagonal chains with respect to the spectral radius
• The least eigenvalue of graphs whose complements are unicyclic
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of a graph with a given domination number
• Location of the eigenvalues of weighted graphs with a cut edge
• On the least eigenvalue of graphs with cut vertices
• The least eigenvalue of graphs with cut edges
• Bounds on the eigenvalues of graphs with cut vertices or edges
• On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
• Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
• A note on the least eigenvalue of a graph with given maximum degree
• Graphs with least eigenvalue \(-2\): ten years on
• The least eigenvalue of the complements of trees
• Upper bounds for some graph invariants in terms of blocks and cut-vertices
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
• Bound on the least eigenvalue of a graph with cut vertices

This page was built for publication: 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 Q972775)