Sharp spectral bounds for the vertex-connectivity of regular graphs

DOI10.1007/S10878-023-00992-0MaRDI QIDQ2687918zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

adjacency matrixsecond largest eigenvalueconnectivityregular graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Mathematical programming (90Cxx)

Recommendations

• Sharp spectral bounds for the edge-connectivity of regular graphs
• Eigenvalues and edge-connectivity of regular graphs
• The second largest eigenvalue and vertex-connectivity of regular multigraphs
• Vertex-connectivity and eigenvalues of graphs
• Spectral bounds for the connectivity of regular graphs with given order

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 871421 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Algebraic conditions for t-tough graphs
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• Edge-connectivity in regular multigraphs from eigenvalues
• Edge-connectivity, eigenvalues, and matchings in regular graphs
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• Eigenvalues and edge-connectivity of regular graphs
• Eigenvalues and expanders
• Matching extendability and connectivity of regular graphs from eigenvalues
• Matchings in regular graphs from eigenvalues
• Minimum cuts, girth and a spectral threshold
• Pseudo-random graphs
• Regular graphs, eigenvalues and regular factors
• Spectra of graphs
• Spectral bounds for the connectivity of regular graphs with given order
• The second largest eigenvalue and vertex-connectivity of regular multigraphs
• The spectrum and toughness of regular graphs
• Tough Ramsey graphs without short cycles
• Toughness and spectrum of a graph
• Vertex-connectivity and eigenvalues of graphs
• Vertex-connectivity and eigenvalues of graphs with fixed girth

Cited in

(8)

• Vertex-connectivity and eigenvalues of graphs
• Vertex-connectivity and eigenvalues of graphs with fixed girth
• scientific article; zbMATH DE number 867634 (Why is no real title available?)
• Eigenvalues and edge-connectivity of regular graphs
• The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
• Spectral bounds for the connectivity of regular graphs with given order
• Edge-connectivity in regular multigraphs from eigenvalues
• Sharp spectral bounds for the edge-connectivity of regular graphs

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)