Distance-balancing of cube-connected cycles graphs
Mokhtar Aouinam-aouina@wiu.eduDepartment of Mathematics and Philosophy Western Illinois UniversityMacomb, Illinois, 61455, U.S.A.View full profile → , Hamed Karamihkarami1@student.gsu.eduDepartment of Mathematics and Statistics Georgia State UniversityAtlanta, Georgia, 30303, U.S.A.View full profile → , *Douglas J. LaFountainCorresponding authord-lafountain@wiu.eduDepartment of Mathematics and Philosophy Western Illinois UniversityMacomb, Illinois, 61455, U.S.A.View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 06 Mar 2024
- Published Online:
- 25 Oct 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2258
- Pages:
- 2849–2861
Abstract
Keywords
Subject Classifications
References
[1] S.B. Akers and B. Krishnamurthy, “A group-theoretic model for symmetric interconnection networks”, IEEE Trans. Comp., vol. 38, no. 4, pp. 555-566 (1989).
[2] K. Balakrishnan, M. Changat, I. Peterin, S. Spacapan, P. Sparl and A.R. Subhamathi, “Strongly distance-balanced graphs and graph products”, Eur. J. Comb., vol. 30, no. 5, pp. 1048-1053 (2009).
[3] M. Behzad, P. Hatami and E.S. Mahmoodian, “On minimum vertex covers in the generalized Petersen graphs P(n,2)”, Bull. Inst. Combin. Appl., vol. 56, pp. 98-102 (2009).
[4] A.E. Brouwer, A.M. Cohen and A. Neumaier, Distance-regular graphs, Heidelberg, Germany: Springer-Verlag (2012).
[5] B. Frelih, “Različni vidiki povezave regularnosti v grafih”, Ph.D. dissertation, Fac. Math. Nat. Sci. and Inf. Tech., Univ. Primorska, Primorska, Slovenia (2014).
[6] I. Fris, I. Havel and P. Liebl, “The diameter of the cube-connected cycles”, Inform. Process. Lett., vol. 61, no. 3, pp. 157-160 (1997).
[7] A. Germa, M.C. Heydemann and D. Sotteau, “Cycles in the cube-connected cycles graph”, Discrete Appl. Math., vol. 83, no. 1-3. pp. 135-155 (1998).
[8] C. Godsil and G. Royle, Algebraic Graph Theory, Heidelberg, Germany: Springer-Verlag (2001).
[9] M. Ezadi, “A further study on edge-distance-balanced property of the generalized Petersen Graphs GP(6n+8,3)”, J. Inf. Optim. Sci., vol. 42, no. 7, pp. 1497-1506 (2021).
[10] M. Ezadi, “A new achievement from reviewing some of the content about the edge-distance-balanced property of the generalized Petersen graphs GP(4i+7,2)”, J. Discrete Math. Sci. Cryptogr., vol. 24, no. 2, pp. 391-399 (2021).
[11] K. Handa, “Bipartite graphs with balanced (a, b)-partitions”, Ars Combin., vol. 51, pp. 113-119 (1999).
[12] F. Harary, “The automorphism group of a hypercube”, J. Univers. Comput. Sci., vol. 6, no. 1, pp. 136-138 (2000).
[13] L.H. Hsu, T.Y. Ho, Y.H. Ho and C.W. Tsay, “Cycles in cube-connected cycles graphs”, Discrete Appl. Math., vol. 167, pp. 163-171 (2014).
[14] J. Jerebic, S. Klavžar and D.F. Rall, “Distance-balanced graphs”, Ann. Comb., vol 12, pp. 71-79 (2008).
[15] H. Karami, “Edge distance-balanced of Hamming graphs”, J. Discrete Math. Sci. Cryptogr., vol. 25, no. 8, pp. 2667-2672 (2022).
[16] K. Kutnar, A. Malnič, D. Marusič and Š. Miklavič, “Distance-balanced graphs: Symmetry conditions”, Discrete Math., vol. 306, no. 16, pp. 1881-1894 (2006).
[17] K. Kutnar, A. Malnič, D. Marusič and Š. Miklavič, “The strongly distance-balanced property of the generalized Petersen graphs”, Ars Math. Cont., vol. 2, no. 1, pp. 41-47 (2009).
[18] K. Kutnar and Š. Miklavič, “Nicely distance-balanced graphs”, Eur. J. Comb., vol. 39, pp. 57-67 (2014).
[19] G. Ma, J. Wang and S. Klavžar, “On distance-balanced generalized Petersen graphs”, Ann. Comb., vol. 28, pp. 329-349 (2023).
[20] Š. Miklavič and P. Sparl, “l-distance-balanced graphs”, Discrete Appl. Math., vol. 244, pp. 143-154 (2018).
[21] F.P. Preparata and J. Vuillemin, “The cube-connected cycles: a versatile network for parallel computation”, Commun. ACM, vol. 25, no. 5, pp. 300-309 (1981).
[22] R. Yang, X. Hou, N. Li and W. Zhong, “A note on the distance-balanced property of generalized Petersen graphs”, Electron. J. Combin., vol. 16, no. 1, pp. 1-3 (2009).
