The cyclic edge-connectivity of strongly regular graphs

DOI10.1007/s00373-019-02031-4zbMath1416.05305OpenAlexW2919152109MaRDI QIDQ2000569

Wenqian Zhang

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

zbMATH Keywords

eigenvaluestrongly regular graphcyclic edge-connectivityedge cut set

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Connectivity (05C40)

Related Items

Spectral threshold for extremal cyclic edge-connectivity ⋮ The edge-connectivity of strongly 3-walk-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The extendability of matchings in strongly regular graphs
• Spectra of graphs
• On a conjecture of Brouwer involving the connectivity of strongly regular graphs
• Distance regular graphs of diameter 3 and strongly regular graphs
• Edge reductions in cyclically \(k\)-connected cubic graphs
• The vertex-connectivity of a distance-regular graph
• The connectivity of strongly regular graphs
• Spherical codes and designs
• Strongly regular graphs with smallest eigenvalue -m
• Eigenvalues and perfect matchings
• Interlacing eigenvalues and graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Disconnecting strongly regular graphs
• The Factorization of Linear Graphs