The cyclic edge-connectivity of strongly regular graphs
From MaRDI portal
Publication:2000569
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Disconnecting strongly regular graphs
- Distance regular graphs of diameter 3 and strongly regular graphs
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Eigenvalues and perfect matchings
- Graph theory with applications
- Interlacing eigenvalues and graphs
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- Spectra of graphs
- Spherical codes and designs
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Strongly regular graphs with smallest eigenvalue -m
- The Factorization of Linear Graphs
- The connectivity of strongly regular graphs
- The extendability of matchings in strongly regular graphs
- The vertex-connectivity of a distance-regular graph
Cited in
(9)- The relation between cyclic edge-connectivity and cyclic connectivity of 3-regular connected graphs
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- Spectral threshold for extremal cyclic edge-connectivity
- The edge-connectivity of strongly 3-walk-regular graphs
- Super-cyclically edge-connected regular graphs
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- Disconnecting strongly regular graphs
- On the super (edge)-connectivity of generalized Johnson graphs
- A note on the cyclical edge-connectivity of fullerene graphs
This page was built for publication: The cyclic edge-connectivity of strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000569)