The least eigenvalue of graphs with given connectivity

DOI10.1016/j.laa.2008.10.031zbMath1171.05365MaRDI QIDQ999814

Yi-Zheng Fan, Dong Liang, Miao-Lin Ye

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

zbMATH Keywords

graph; vertex connectivity; least eigenvalue; edge connectivity

Mathematics Subject Classification ID

90C27: Combinatorial optimization

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C40: Connectivity

Related Items

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, Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity

Cites Work

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