Abstract
The super edge-connectivity of a connected graph G, denoted by \({\lambda }'\left( G \right) \), if exists, is the minimum number of edges whose deletion disconnects the graph such that each component has no isolated vertices. The direct product of graphs G and H, denoted by \(G\times H\), is the graph with vertex set \(V\left( G\times H \right) =V\left( G \right) \times V\left( H \right) \), where two vertices \(\left( {{u}_{1}},{{v}_{1}} \right) \) and \(\left( {{u}_{2}},{{v}_{2}} \right) \) are adjacent in \(G\times H\) if and only if \({{u}_{1}}{{u}_{2}}\in E\left( G \right) \) and \({{v}_{1}}{{v}_{2}}\in E\left( H \right) \). In this paper, it is proved that \({\lambda }'\left( G\times {{C}_{n}} \right) = \min \{ 2n{\lambda }'\left( G \right) ,2\underset{xy\in E\left( G \right) }{{\min }}\,\left( {{\deg }_{G}}\left( x \right) +{{\deg }_{G}}\left( y \right) \right) -2 \}\) for (i) any connected graph G with \(\left| G \right| \le n\) or \(\Delta \left( G \right) \le n-1\) and an odd cycle \({{C}_{n}}\), or (ii) any split graph G with \(\left| G \right| \le n\) or \(\Delta \left( G \right) \le n-1\) and a cycle \({{C}_{n}}\).



Similar content being viewed by others
References
Brešar B, Špacapan S (2008) On the connectivity of the direct product of graphs. Austral J Combin 41:45–56
Brešar B, Imrich W, Klavzar S, Zmazek B (2005) Hypercubes as direct products. SIAM J Discrete Math 18:778–786
Cao X, Brglez Š, Špacapan S, Vumar E (2011) On edge connectivity of direct products of graphs. Inf Process Lett 111(18):899–902
Dirac G (1960) Généralisations du théoréme de menger. C R Acad Sci 250:4252–4253
Esfahanian AH, Hakimi SL (1988) On computing a conditional edge-connectivity of a graph. Inf Process Lett 27:195–199
Ekinci GB, Kirlangic A (2018) The super edge connectivity of Kronecker product graphs. Rairo-Oper Res 52:561–566
Guo LT, Qin CF, Guo XF (2010) Super connectivity of Kronecker products of graphs. Inf Process Lett 110:659–661
Ghozati S (1999) A finite automata approach to modeling the cross product of interconnection networks. Math Comput Model 30(7):185–200
Harary F (1983) Conditional connectivity. Networks 13:347–357
Lubetzky E, Alon N (2007) Independent sets in tensor powers. J Graph Theory 54:73–87
Lammprey R, Barnes B (1974) Products of graphs and applications. Model Simul 5:1119–1123
Ma TL, Wang JL, Zhang MZ (2019) The restricted edge-connectivity of Kronecker product graphs. Parallel Process Lett 29(3):1950012
Montejano LP, Sau I (2017) On the complexity of computing the \(k\)-restricted edge-connectivity of a graph. Theor Comput Sci 662:31–39
Špacapan S (2013) A characterization of the edge connectivity of direct products of graphs. Discrete Math 313(12):1385–1393
Sonawane AV, Borse YM (2021) Connectivity of the tensor product of a graph and a cycle. J Ramanujan Math Soc 36(4):325–330
Soliemany F, Ghasemi M, Varmazyar R (2022) Super connectivity of a family of direct product graphs. Inter J Comput Math Comput Syst Theory 7(1):1–5
Weichsel PM (1962) The Kronecker product of graphs. Proc Am Math Soc 13:47–52
Wang W, Yan ZD (2012) Connectivity of Kronecker products by \({{k}_{2}}\). Appl Math Lett 25:172–174
Yang C (2007) Connectivity and fault-diameter of product graphs, Ph.D. Thesis, University of Science and Technology of China
Yin JQ, Tian YZ (2023) The super restricted edge-connectedness of direct product graphs. Parallel Process Lett 33(3):235008
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.
The research is supported by Natural Science Foundation of Shanxi Province (Grant No. 202103021223110), and Taiyuan University of Technology Science Foundation for Youths (Grant No. 2022QN097).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Guo, S., Hu, X., Yang, W. et al. The super edge-connectivity of direct product of a graph and a cycle. J Supercomput 80, 23367–23383 (2024). https://doi.org/10.1007/s11227-024-06352-x
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-024-06352-x