Abstract
Let G be a connected graph. An edge cut set M of G is a cyclic edge cut set if there are at least two components of \(G-M\) which contain a cycle. The cyclic edge-connectivity of G is the minimum cardinality of a cyclic edge cut set (if exists) of G. In this paper, we show that the cyclic edge-connectivity of a connected strongly regular graph G (not \(K_{3,3}\)) of degree \(k\ge 3\) with girth c is equal to \((k-2)c\), where \(c=3, 4\) or 5. Moreover, if G is not the triangular graph srg-(10, 6, 3, 4), the complete multi-partite graph \(K_{2,2,2,2}\) or the lattice graph srg-(16, 6, 2, 2), then each cyclic edge cut set of size \((k-2)c\) is precisely the set of edges incident with a cycle of length c in G.
Similar content being viewed by others
References
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, Macmillan, London. Elsevier, New York (1976)
Brouwer, A.E.: Parameters of strongly regular graphs, list available at http://www.win.tue.nl/~aeb/graphs/srg/srgtab.html
Brouwer, A.E., Haemers, W.H.: Spectra of Graphs. Springer, New York (2012)
Brouwer, A.E., Haemers, W.H.: Eigenvalues and perfect matchings. Linear Algebra Appl. 395, 155–162 (2005)
Brouwer, A.E., Koolen, J.H.: The vertex-connectivity of distance-regular graphs. Eur. J. Combin. 30, 668–673 (2009)
Brouwer, A.E., Mesner, D.M.: The connectivity of strongly regular graphs. Eur. J. Combin. 6, 215–216 (1985)
Cioabǎ, S.M., Kim, K., Koolen, J.H.: On a conjecture of Brouwer involving the connectivity of strongly regular graphs. J. Combin. Theory Ser. A 119, 904–922 (2012)
Cioabǎ, S.M., Koolen, J.H., Li, W.: Disconnecting strongly regular graphs. Eur. J. Combin. 38, 1–11 (2014)
Cioabǎ, S.M., Li, W.: The extendability of matchings in strongly regular graphs. Electron. J. Combin. 21(2), 23 (2014). (Paper 2.34)
Delsarte, P., Goethals, J.M., Seidel, J.J.: Spherical codes and designs. Geom. Dedicata 6, 363–388 (1977)
Godsil, C., Royle, G.: Algebraic Graph Theory (Graduate Texts in Mathematics, vol. 207). Springer, New York (2001)
Haemers, W.H.: Interlacing eigenvalues and graphs. Linear Algebra Appl. 227–228, 593–616 (1995)
McCuaig, W.: Edge-reductions in cyclically \(k\)-connected cubic graphs. J. Combin. Theory Ser. B 56, 16–44 (1992)
Neumaier, A.: Strongly regular graphs with smallest eigenvalue \(-m\). Arch. Math. 33(4), 392–400 (1979-80)
Seidel, J.J.: Strongly regular graphs with \((-1,1,0)\) adjacency matrix having eigenvalue \(3\). Linear Algebra Appl. 1, 281–298 (1968)
Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 22, 107–111 (1947)
Acknowledgements
The author would like to thank the editors and the anonymous referees for their helpful comments on improving the representation of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhang, W. The Cyclic Edge-Connectivity of Strongly Regular Graphs. Graphs and Combinatorics 35, 779–785 (2019). https://doi.org/10.1007/s00373-019-02031-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-019-02031-4