Abstract
E.R. van Dam and G.R. Omidi generalized the concept of strongly regular graphs as follows. If for any two vertices the number of \(\ell \)-walks (walks of length \(\ell \)) from one vertex to the other is the same which depends only on whether the two vertices are the same, adjacent or non-adjacent, then G is called a strongly \(\ell \)-walk-regular graph. The existence of strongly \(\ell \)-walk-regular graphs which are not strongly 3-walk-regular graphs is unknown. In this paper, we prove that the edge-connectivity of a connected strongly 3-walk-regular graph G of degree \(k\ge 3\) is equal to k. Moreover, if G is not the graph formed by adding a perfect matching between two copies of \(K_{4}\), then each edge cut set of size k is precisely the set of edges incident with a vertex of G. For a regular graph G in general, we also give a sufficient and tight condition such that G is 1-extendable.
Similar content being viewed by others
References
Anderson, I.: Perfect matchings of a graph. J. Combin. Theory 10, 183–186 (1971)
Brouwer, A.E., Haemers, W.H.: Spectra of Graphs. Springer, New York (2012)
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)
Cvetković, D., Rowlinson, P., Simić, S.: Eigenspace of Graphs. Cambridge University Press, Cambridge (1997)
Duval, A.M.: A directed graph version of strongly regular graphs. J. Combin. Theory, Ser. A 47, 71–100 (1988)
van Dam, E.R.: Regular graphs with four eigenvalues. Linear Algebra Appl. 226–228, 139–162 (1995)
van Dam, E.R., Omidi, G.R.: Strongly walk-regular graphs. J. Combin. Theory, Ser. A 120, 803–810 (2013)
van Dam, E.R., Omidi, G.R.: Directed strongly walk-regular graphs. J. Algebr. Combin. 120, 1–17 (2015)
Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, New York (2001)
Haemers, W.H.: Interlacing eigenvalues and graphs. Linear Algebra Appl. 226, 593–616 (1995)
Lovász, L., Plummer, M. D.: Matching Theory, Ann. Discrete Math (1986)
Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 2, 107–111 (1947)
Zhang, W.: The cyclic edge-connectivity of strongly regular graphs. Graphs Combin. 35, 779–785 (2019)
Acknowledgements
The authors are grateful for the useful comments which improve the paper. This work is supported by the National Natural Science Foundation of China (Grant Nos. 61370187 and 11731002).
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
Feng, R., Zhang, W. The Edge-Connectivity of Strongly 3-Walk-Regular Graphs. Graphs and Combinatorics 36, 115–124 (2020). https://doi.org/10.1007/s00373-019-02121-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-019-02121-3