The cyclic edge-connectivity of strongly regular graphs
DOI10.1007/S00373-019-02031-4zbMATH Open1416.05305OpenAlexW2919152109WikidataQ128284180 ScholiaQ128284180MaRDI QIDQ2000569FDOQ2000569
Publication date: 28 June 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-019-02031-4
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cites Work
- Spectra of graphs
- Interlacing eigenvalues and graphs
- Title not available (Why is that?)
- The Factorization of Linear Graphs
- Distance regular graphs of diameter 3 and strongly regular graphs
- Title not available (Why is that?)
- Strongly regular graphs with smallest eigenvalue -m
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Disconnecting strongly regular graphs
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Spherical codes and designs
- The vertex-connectivity of a distance-regular graph
- Eigenvalues and perfect matchings
- The connectivity of strongly regular graphs
- The extendability of matchings in strongly regular graphs
Cited In (6)
- On the super (edge)-connectivity of generalized Johnson graphs
- A note on the cyclical edge-connectivity of fullerene graphs
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- Super-cyclically edge-connected regular graphs
- The edge-connectivity of strongly 3-walk-regular graphs
- Spectral threshold for extremal cyclic edge-connectivity
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)