Abstract
A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is said to be cyclically separable. For a cyclically separable graph G, the cyclic edge-connectivity \(\lambda _c(G)\) is the cardinality of a minimum cyclic edge-cut of G. Let \(\zeta (G)=\min \{\omega (X) | X \text{ induce } \text{ a } \text{ shortest } \text{ cycle } \text{ in } G\}\), where \(\omega (X)\) is the number of edges with one end in X and the other end in \(V(G)-X\). A cyclically separable graph G with \(\lambda _c(G)=\zeta (G)\) is said to be cyclically optimal. In particular, we call a graph G super cyclically edge-connected if every minimum cyclic edge-cut isolates a shortest cycle of G. In this work, we first discuss the cyclic edge-connectivity of vertex transitive graphs, regular double-orbit graphs, and the double-orbit graphs with two orbits of same size; moreover, we also discuss the super-cyclic edge-connectivity of double-orbit graphs mentioned above.
Similar content being viewed by others
References
Afkhami, M., Ahmadi, M.R., Jahani-Nezhad, R., Khashyarmanesh, K.: Cayley graphs of ideals in a commutative ring. Bull. Malays. Math. Sci. Soc. 37, 833–843 (2014)
Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1993)
Chen, J., Meng, J.: Super edge-connectivity of mixed cayley graph. Discrete Math. 309, 264–270 (2009)
Liu, F., Meng, J.: Edge connectivity of regular graph with two orbits. Discrete Math. 308, 3711–3716 (2008)
Latifi, S., Hegde, M., Naraghi-Pour, M.: Conditional connectivity measures for large multiprocessor systems. IEEE Trans. Comput. 43, 218–222 (1994)
Lin, H., Yang, W., Meng, J.: On cyclic edge connectivity of graphs with two orbits of same size. J. Math. Study 43, 233–241 (2010)
Lou, D.J., Wang, W.: Characterization of graphs with infinite cyclic edge connectivity. Discrete Math. 308, 2094–2103 (2008)
Lovász, L.: On graphs not containing independent circuits. Mat. Lapole 16, 289–299 (1965). (in Hungarian)
Mader, M.: Minimale \(n\)-fach Kantenzusammenh genden Graphen. Math. Ann. 191, 21–28 (1971)
Nedela, R., Škoviera, M.: Atoms of cyclic connectivity in cubic graphs. Math. SlOVaca 45, 481–499 (1995)
Plummer, M.D.: On the cyclic connectivity of planar graphs. In: Lecture Notes in Mathematics, vol. 303, pp. 235–242 (1972)
Tian, Y., Meng, J.: \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\). Inf. Process. Lett. 109, 683–686 (2009)
Tindell, R.: Connectivity of cayley graphs. In: Du, D.Z., Hsu, D.F. (eds.) Combinatorial Network Theory, pp. 41–64. Kluwer, Dordrecht (1996)
Wang, B., Zhang, Z.: On cyclic edge-connectivity of transitive graphs. Discrete Math. 309, 4555–4563 (2009)
Watkins, M.E.: Connectivity of transitive graphs. J. Comb. Theory 8, 23–29 (1970)
Xu, J.M., Liu, Q.: 2-restricted edge connectivity of vertex transitive graphs. Australas. J. Comb. 30, 41–49 (2004)
Xu, M.Y., Huang, J.H., Li, H.L., Li, S.R.: Introduction to Group Theory. Academic Pulishes, London (1999)
Yang, W., Lin, H., Guo, X.: On cyclic edge connectivity of regular graphs with two orbits. Ars Comb. 119, 135–141 (2015)
Yang, W., Zhang, Z., Guo, X., Cheng, E., Lipták, L.: On the edge-connectivity of graphs with two orbits of the same size. Discrete Math. 311, 1768–1777 (2011)
Yang, W.: On the connectivity of graphs. PhD thesis in Xiamen University (2012)
Zhang, Z., Wang, B.: Super cyclically edge connected transitive graphs. J. Comb. Optim. 22, 549–562 (2011)
Acknowledgments
The authors would like to thank the referees for the valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Sanming Zhou.
The research is supported by NSFC (Nos. 11301371, 11101345, 11401119), and Natural Sciences Foundation of Shanxi Province (No. 2014021010-2).
Rights and permissions
About this article
Cite this article
Yang, W., Qin, C. & Chen, M. On Cyclic Edge-Connectivity and Super-Cyclic Edge-Connectivity of Double-Orbit Graphs. Bull. Malays. Math. Sci. Soc. 39 (Suppl 1), 13–27 (2016). https://doi.org/10.1007/s40840-015-0286-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40840-015-0286-y