The least eigenvalue of graphs with given connectivity

DOI10.1016/J.LAA.2008.10.031zbMATH Open1171.05365OpenAlexW2110629991MaRDI QIDQ999814FDOQ999814

Authors: Miao-Lin Ye, Yizheng Fan, Dong Liang 

Publication date: 10 February 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.10.031

Recommendations

• The least eigenvalue of graphs
• scientific article; zbMATH DE number 500503
• Further results on the least eigenvalue of connected graphs
• The least eigenvalue of a graph with a given domination number
• Least eigenvalue of the connected graphs whose complements are cacti
• The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected
• On the least distance eigenvalue of a graph
• Least \(Q\)-eigenvalue of a graph
• The least eigenvalue of graphs with cut edges
• The least eigenvalue of a graph with cut vertices

zbMATH Keywords

graphleast eigenvaluevertex connectivityedge connectivity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial optimization (90C27) Connectivity (05C40)

Cites Work

• On the spectral radius of (0,1)-matrices
• Maximal graphs and graphs with maximal spectral radius
• On the spectral radius of graphs with cut vertices
• Graphs for which the least eigenvalue is minimal. I
• The minimal spectral radius of graphs with a given diameter
• Graphs for which the least eigenvalue is minimal. II.
• Lower bounds on the spectra of symmetric matrices with nonnegative entries
• Bounds of eigenvalues of graphs
• Bounds on the largest eigenvalues of trees with a given size of matching
• On the spectral radius of graphs with a given domination number
• On the spectral radius of graphs with cut edges
• On the spectral radius of trees with fixed diameter
• A bound on the spectral radius of graphs with \(e\) edges
• Bounds on eigenvalues and chromatic numbers
• Spectral radii of graphs with given chromatic number
• Spectral radius of graphs with given matching number
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree

Cited In (20)

• On the spectrum of an equitable quotient matrix and its application
• The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected
• 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
• An edge-rotating theorem on the least eigenvalue of graphs
• The least eigenvalue of graphs whose complements are unicyclic
• Connectivity and eigenvalues of graphs with given girth or clique number
• The least eigenvalue of a graph with a given domination number
• Some observations on the smallest adjacency eigenvalue of a graph
• Minimizing the least eigenvalue of graphs with fixed order and size
• The least eigenvalue of graphs with cut edges
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
• Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
• On the nullity of connected graphs with least eigenvalue at least \(-2\)
• The least eigenvalue of the complements of trees
• The least eigenvalue of a graph with 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 graphs with given connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999814)