The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
From MaRDI portal
Publication:6628841
DOI10.13001/ELA.2024.7977MaRDI QIDQ6628841FDOQ6628841
Authors: Tingyan Ma, Ligong Wang, Yang Hu 
Publication date: 29 October 2024
Published in: ELA. The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Recommendations
- The second largest eigenvalue and vertex-connectivity of regular multigraphs
- Vertex-connectivity and eigenvalues of graphs
- Sharp spectral bounds for the vertex-connectivity of regular graphs
- Edge-connectivity in regular multigraphs from eigenvalues
- Sharp spectral bounds for the edge-connectivity of regular graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)
Cites Work
- Matrix Analysis
- Graph theory
- Title not available (Why is that?)
- Spectra of graphs
- Interlacing eigenvalues and graphs
- On the third largest eigenvalue of a graph
- On the third largest eigenvalue of graphs
- Edge-disjoint spanning trees and eigenvalues
- Old and new results on algebraic connectivity of graphs
- On graphs with equal algebraic and vertex connectivity
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Eigenvalues and edge-connectivity of regular graphs
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Minimum cuts, girth and a spectral threshold
- The six classes of trees with the largest algebraic connectivity
- Vertex-connectivity and eigenvalues of graphs
- A lower bound for algebraic connectivity based on the connection-graph-stability method
- Spectral bounds for the connectivity of regular graphs with given order
- Edge connectivity, packing spanning trees, and eigenvalues of graphs
- Vertex-connectivity and eigenvalues of graphs with fixed girth
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
- The second largest eigenvalue and vertex-connectivity of regular multigraphs
- Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
This page was built for publication: The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6628841)
