Vertex-connectivity and eigenvalues of graphs
From MaRDI portal
Publication:2272481
DOI10.1016/j.laa.2019.05.030zbMath1419.05126OpenAlexW2948002074WikidataQ127804094 ScholiaQ127804094MaRDI QIDQ2272481
Zheng-Jiang Xia, Zhen-Mu Hong, Hong-Jian Lai
Publication date: 10 September 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.05.030
Laplacian eigenvaluealgebraic connectivityvertex-connectivityadjacency eigenvaluesignless Laplacian eigenvalue
Related Items (4)
Sharp spectral bounds for the vertex-connectivity of regular graphs ⋮ Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs ⋮ Connectivity and eigenvalues of graphs with given girth or clique number ⋮ Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
Cites Work
- Unnamed Item
- Unnamed Item
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Spectra of graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Minimum cuts, girth and a spectral threshold
- Eigenvalues and edge-connectivity of regular graphs
- Interlacing eigenvalues and graphs
- Vertex-connectivity and eigenvalues of graphs with fixed girth
- The second largest eigenvalue and vertex-connectivity of regular multigraphs
- Note on edge-disjoint spanning trees and eigenvalues
- Edge-disjoint spanning trees and eigenvalues of graphs
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- Edge-disjoint spanning trees and eigenvalues
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- Spectral Bounds for the Connectivity of Regular Graphs with Given Order
- On graphs with equal algebraic and vertex connectivity
- Edge-connectivity in regular multigraphs from eigenvalues
This page was built for publication: Vertex-connectivity and eigenvalues of graphs
