Eigenvalues and edge-connectivity of regular graphs
From MaRDI portal
Recommendations
- Edge-connectivity in regular multigraphs from eigenvalues
- Sharp spectral bounds for the edge-connectivity of regular graphs
- Sharp spectral bounds for the vertex-connectivity of regular graphs
- The second largest eigenvalue and vertex-connectivity of regular multigraphs
- Edge-connectivity, eigenvalues, and matchings in regular graphs
Cites work
- Eigenvalues and perfect matchings
- Expander graphs and their applications
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 997668 (Why is no real title available?)
- scientific article; zbMATH DE number 3668627 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 1054729 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Minimum cuts, girth and a spectral threshold
- Old and new results on algebraic connectivity of graphs
- On graphs with equal algebraic and vertex connectivity
- Pseudo-random graphs
- The vertex-connectivity of a distance-regular graph
Cited in
(47)- Matchings in regular graphs from eigenvalues
- On the connectivity of graphs in association schemes
- Extremal problems on saturation for the family of k-edge-connected graphs
- Spectral radius and \(k\)-connectedness of a graph
- The effect on eigenvalues of connected graphs by adding edges
- Tight estimates for eigenvalues of regular graphs
- Vertex-connectivity and eigenvalues of graphs with fixed girth
- Spectral threshold for extremal cyclic edge-connectivity
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees
- The second largest eigenvalue and vertex-connectivity of regular multigraphs
- 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\)
- Note on edge-disjoint spanning trees and eigenvalues
- Vertex-connectivity and eigenvalues of graphs
- Cospectral pairs of regular graphs with different connectivity
- Matching extendability and connectivity of regular graphs from eigenvalues
- Spanning tree packing number and eigenvalues of graphs with given girth
- Star complements and edge-connectivity in finite graphs
- Edge-disjoint spanning trees and eigenvalues of graphs
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- Edge-disjoint spanning trees and eigenvalues
- Sharp spectral bounds for the vertex-connectivity of regular graphs
- Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
- Spectral conditions for connectivity, toughness and perfect k-matchings of regular graphs
- Sharp spectral bounds for the edge-connectivity of regular graphs
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Edge-connectivity, eigenvalues, and matchings in regular graphs
- scientific article; zbMATH DE number 5947262 (Why is no real title available?)
- Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Eigenvalue estimates on a connected finite graph
- Spectral bounds for the connectivity of regular graphs with given order
- Edge connectivity, packing spanning trees, and eigenvalues of graphs
- Spectral conditions for some graphical properties
- Edge-connectivity in regular multigraphs from eigenvalues
- Graph rigidity properties of Ramanujan graphs
- Extremal spectral radius and essential edge-connectivity
- The \(Q\)-index and connectivity of graphs
- The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
- l-connectivity, l-edge-connectivity and spectral radius of graphs
- Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs
- Extremal spectral radius of graphs with cyclic edge-connectivity
- A unified approach to the spectral radius, connectivity and edge-connectivity of graphs
- Connectivity, spanning tree packing number and signless Laplacian spectral radius
- Spectral conditions for edge connectivity and packing spanning trees in multigraphs
This page was built for publication: Eigenvalues and edge-connectivity of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044623)
