Sharp spectral bounds for the vertex-connectivity of regular graphs
From MaRDI portal
Publication:2687918
DOI10.1007/S10878-023-00992-0OpenAlexW4318960932MaRDI QIDQ2687918FDOQ2687918
Publication date: 7 March 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-023-00992-0
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenvalues and expanders
- Spectra of graphs
- Matchings in regular graphs from eigenvalues
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- Algebraic conditions for t-tough graphs
- The spectrum and toughness of regular graphs
- Regular graphs, eigenvalues and regular factors
- Eigenvalues and edge-connectivity of regular graphs
- Edge-connectivity in regular multigraphs from eigenvalues
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
- Matching extendability and connectivity of regular graphs from eigenvalues
- Minimum cuts, girth and a spectral threshold
- Vertex-connectivity and eigenvalues of graphs
- Spectral Bounds for the Connectivity of Regular Graphs with Given Order
- Vertex-connectivity and eigenvalues of graphs with fixed girth
- The second largest eigenvalue and vertex-connectivity of regular multigraphs
Cited In (1)
This page was built for publication: Sharp spectral bounds for the vertex-connectivity of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687918)
