The least eigenvalue of a graph with cut vertices

DOI10.1016/J.LAA.2010.01.030zbMATH Open1189.05107OpenAlexW2011106299MaRDI QIDQ972775FDOQ972775

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

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

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)

Cites Work

• Title not available (Why is that?)
• On the spectral radius of (0,1)-matrices
• 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
• Graphs for which the least eigenvalue is minimal. I
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• The least eigenvalue of graphs with given connectivity
• Graphs for which the least eigenvalue is minimal. II.
• The largest eigenvalue of a graph: A survey
• Bicyclic graphs for which the least eigenvalue is minimum
• Sharp lower bounds of the least eigenvalue of planar graphs

Cited In (20)

• On the least eigenvalue of graphs with matching number two
• On the least eigenvalue of cacti with pendant vertices
• On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
• The least eigenvalue of graphs whose complements have only two pendent vertices
• 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
• Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
• On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
• A note on the least eigenvalue of a graph with given maximum degree
• Graphs with least eigenvalue \(-2\): ten years on
• Upper bounds for some graph invariants in terms of blocks and cut-vertices
• The least eigenvalue of the complements of trees
• Title not available (Why is that?)
• 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)