Eigenvalues and edge-connectivity of regular graphs

DOI10.1016/j.laa.2009.08.029zbMath1197.05087OpenAlexW2098108980MaRDI QIDQ1044623

Sebastian M. Cioabă

Publication date: 18 December 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.08.029

zbMATH Keywords

eigenvaluesconnectivityregular graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items

Spectral Bounds for the Connectivity of Regular Graphs with Given Order, Extremal graphs for a spectral inequality on edge-disjoint spanning trees, Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs, The second largest eigenvalue and vertex-connectivity of regular multigraphs, On the connectivity of graphs in association schemes, Graph rigidity properties of Ramanujan graphs, Sharp spectral bounds for the vertex-connectivity of regular graphs, Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs, Edge-disjoint spanning trees and eigenvalues of regular graphs, Spectral conditions for edge connectivity and packing spanning trees in multigraphs, Edge-disjoint spanning trees and eigenvalues of graphs, Edge-connectivity and (signless) Laplacian eigenvalue of graphs, Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs, Sharp spectral bounds for the edge-connectivity of regular graphs, Edge-disjoint spanning trees and eigenvalues, Edge connectivity, packing spanning trees, and eigenvalues of graphs, Toughness in pseudo-random graphs, Connectivity and eigenvalues of graphs with given girth or clique number, On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\), Spectral conditions for graphs to be β-deficient involving minimum degree, Extremal problems on saturation for the family of $k$-edge-connected graphs, Spectral radius and \(k\)-connectedness of a graph, Note on edge-disjoint spanning trees and eigenvalues, Spectral conditions for some graphical properties, Vertex-connectivity and eigenvalues of graphs with fixed girth, Vertex-connectivity and eigenvalues of graphs, Edge-connectivity in regular multigraphs from eigenvalues, Cospectral pairs of regular graphs with different connectivity, Spectral threshold for extremal cyclic edge-connectivity, Matching extendability and connectivity of regular graphs from eigenvalues, Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs, Spanning tree packing number and eigenvalues of graphs with given girth, Star complements and edge-connectivity in finite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Old and new results on algebraic connectivity of graphs
• The vertex-connectivity of a distance-regular graph
• Minimum cuts, girth and a spectral threshold
• Eigenvalues and perfect matchings
• Interlacing eigenvalues and graphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Expander graphs and their applications
• On graphs with equal algebraic and vertex connectivity