Abstract
Let \(\Gamma = (V, E)\) be a graph and a, b nonnegative integers. An (a, b)-regular set in \(\Gamma \) is a nonempty proper subset D of V such that every vertex in D has exactly a neighbours in D and every vertex in \(V{\setminus }D\) has exactly b neighbours in D. A (0, 1)-regular set is called a perfect code, an efficient dominating set, or an independent perfect dominating set. A subset D of a group G is called an (a, b)-regular set of G if it is an (a, b)-regular set in some Cayley graph of G, and an (a, b)-regular set in a Cayley graph of G is called a subgroup (a, b)-regular set if it is also a subgroup of G. In this paper, we study (a, b)-regular sets in Cayley graphs with a focus on (0, k)-regular sets, where \(k \ge 1\) is an integer. Among other things, we determine when a non-trivial proper normal subgroup of a group is a (0, k)-regular set of the group. We also determine all subgroup (0, k)-regular sets of dihedral groups and generalized quaternion groups. We obtain necessary and sufficient conditions for a hypercube or the Cartesian product of n copies of the cycle of length p to admit (0, k)-regular sets, where p is an odd prime. Our results generalize several known results from perfect codes to (0, k)-regular sets.
Similar content being viewed by others
Data deposition Information
No data were used to support this study.
References
AlBdaiwi, B.F., Horak, P., Milazzo, L.: Enumerating and decoding perfect linear Lee codes. Des. Codes Cryptogr. 52(2), 155–162 (2009)
Bailey, R.A., Cameron, P.J., Gavrilyuk, A.L., Goryainov, S.V.: Equitable partitions of Latin-square graphs. J. Combin. Des. 27(3), 142–160 (2019)
Bailey, R.A., Cameron, P.J., Zhou, S.: Equitable partitions of Cayley graphs (in preparation)
Behajaina, A., Maleki, R., Razafimahatratra, A.S.: On non-normal subgroup perfect codes. Australas. J. Combin. 81(3), 474–479 (2021)
Bespalov, E.A., Krotov, D.S., Matiushev, A.A., Taranenko, A.A., Vorob’ev, K.V.: Perfect \(2\)-colorings of Hamming graphs. J. Combin. Des. 29(6), 367–396 (2021)
Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (2001)
Cardoso, D.M.: An overview of \((\kappa ,\tau )\)-regular sets and their applications. Discrete Appl. Math. 269, 2–10 (2019)
Chen, J., Wang, Y., Xia, B.: Characterization of subgroup perfect codes in Cayley graphs. Discrete Math. 343(5), 111813 (2020)
Dejter, I.J., Serra, O.: Efficient dominating sets in Cayley graphs. Discrete Appl. Math. 129(2–3), 319–328 (2003)
Deng, Y.-P.: Efficient dominating sets in circulant graphs with domination number prime. Inform. Process. Lett. 114(12), 700–702 (2014)
Deng, Y.-P., Sun, Y.-Q., Liu, Q., Wang, H.-Q.: Efficient dominating sets in circulant graphs. Discrete Math. 340(7), 1503–1507 (2017)
Feng, R., Huang, H., Zhou, S.: Perfect codes in circulant graphs. Discrete Math. 340(7), 1522–1527 (2017)
Fon-Der-Flaas, D.G.: Perfect \(2\)-colorings of a hypercube. Siberian Math. J. 48(4), 740–745 (2007). (Translated feom Sibirsk. Mat. Zh. 48(4) 923–930.) (2007)
Gavrilyuk, A.L., Goryainov, S.V.: On perfect \(2\)-colorings of Johnson graphs \(J(v,3)\). J. Combin. Des. 21(6), 232–252 (2013)
Godsil, C.: Algebraic Combinatorics. Chapman & Hall, New York (1993)
Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics, Springer, New York (2001)
Golomb, S.W., Welch, L.R.: Perfect codes in the Lee metric and the packing of polyominoes. SIAM J. Appl. Math. 18(2), 302–317 (1970)
Hamming, R.W.: Error detecting and error correcting codes. Bell. Syst. Tech. J. 29(2), 147–160 (1950)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
Heden, O.: A survey of perfect codes. Adv. Math. Commum. 2(2), 223–247 (2008)
Horak, P., Kim, D.: 50 Years of the Golomb–Welch conjecture. IEEE Trans. Inform. Theory 64(4), 3048–3061 (2018)
Huang, H., Xia, B., Zhou, S.: Perfect codes in Cayley graphs. SIAM J. Discrete Math. 32(1), 548–559 (2018)
Kwak, J.H., Chun, J.-H., Lee, J.: Enumeration of regular graph coverings having finite abelian covering transformation groups. SIAM J. Discrete Math. 11(2), 273–285 (1998)
Kwon, Y.S., Lee, J.: Perfect domination sets in Cayley graphs. Discrete Appl. Math. 162, 259–263 (2014)
Lee, J.: Independent perfect domination sets in Cayley graphs. J. Graph Theory 37(4), 213–219 (2001)
Ma, X., Walls, G.L., Wang, K., Zhou, S.: Subgroup perfect codes in Cayley graphs. SIAM J. Discrete Math. 32(3), 1009–1931 (2020)
Martínez, C., Beivide, R., Gabidulin, E.: Perfect codes for metrics induced by circulant graphs. IEEE Trans. Inform. Theory 53(9), 253–258 (2007)
Mehdi, A., Hamed, K.: Perfect \(2\)-colorings of the generalized Petersen graph. Proc. Indian Acad. Sci. (Math. Sci.) 126(3), 289–294 (2016)
Mehdi, A., Efat, A.: Perfect \(2\)-colorings of the Johnson graph \(J(9,4)\). Math. Sci. 16(2), 122–136 (2022)
Obradović, N., Peters, J., Ružić, G.: Efficient domination in circulant graphs with two chord lengths. Inform. Process. Lett. 102(6), 253–258 (2007)
Reji Kumar, K., MacGillivray, G.: Efficient domination in circulant graphs. Discrete Math. 313(6), 767–771 (2013)
TamizhChelvam, T., Mutharasu, S.: Subgroups as efficient dominating sets in Cayley graphs. Discrete Appl. Math. 161(9), 1187–1190 (2013)
Wang, Y., Xia, B., Zhou, S.: Subgroup regular sets in Cayley graphs. Discrete Math. 345(11), 113023 (2022)
Wang, Y., Xia, B., Zhou, S.: Regular sets in Cayley graphs. JACO 57, 547–558 (2023)
Zhang, J., Zhou, S.: On subgroup perfect codes in Cayley graphs. Eur. J. Combin. 91, 103228 (2021)
Zhang, J., Zhou, S., Corrigendum to “On subgroup perfect codes in Cayley graphs” [European J. Combin. 91,: 103228]. European J. Combin. 101(2022), 103461 (2021)
Zhang, J., Zhou, S.: Nowhere-zero 3-flows in nilpotently vertex-transitive graphs (preprint). arXiv:2203.13575
Acknowledgements
The authors would like to thank the anonymous reviews for their valuable comments which improved the paper. Xu was supported by the National Natural Science Foundation of China (Grant No.@ 12071194, 11901263).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflicts of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
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
Wang, X., Xu, SJ. & Zhou, S. On regular sets in Cayley graphs. J Algebr Comb 59, 735–759 (2024). https://doi.org/10.1007/s10801-024-01298-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10801-024-01298-y