The second largest eigenvalue and vertex-connectivity of regular multigraphs
From MaRDI portal
Publication:2181221
DOI10.1016/j.dam.2019.10.010zbMath1439.05128arXiv1603.03960OpenAlexW2985045181MaRDI QIDQ2181221
Publication date: 18 May 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.03960
Related Items (4)
Sharp spectral bounds for the vertex-connectivity of regular graphs ⋮ Sharp spectral bounds for the edge-connectivity of regular graphs ⋮ Connectivity and eigenvalues of graphs with given girth or clique number ⋮ Vertex-connectivity and eigenvalues of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral radius and fractional matchings in graphs
- Minimum cuts, girth and a spectral threshold
- Eigenvalues and edge-connectivity of regular graphs
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Spectral Bounds for the Connectivity of Regular Graphs with Given Order
- Edge-connectivity in regular multigraphs from eigenvalues
This page was built for publication: The second largest eigenvalue and vertex-connectivity of regular multigraphs