{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T16:02:17Z","timestamp":1780761737138,"version":"3.54.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:00:00Z","timestamp":1780704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:00:00Z","timestamp":1780704000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101575"],"award-info":[{"award-number":["12101575"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801441"],"award-info":[{"award-number":["11801441"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12326333"],"award-info":[{"award-number":["12326333"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2652019319"],"award-info":[{"award-number":["2652019319"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shaanxi Fundamental Science Research Project for Mathematics and Physics","award":["No. 22JSQ024"],"award-info":[{"award-number":["No. 22JSQ024"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s00373-026-03049-1","type":"journal-article","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T15:58:33Z","timestamp":1780761513000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Perfect codes in quintic Cayley graphs on abelian groups"],"prefix":"10.1007","volume":"42","author":[{"given":"Yuefeng","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuanlong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qing","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,6]]},"reference":[{"key":"3049_CR1","first-page":"107","volume":"12","author":"B Abughazale","year":"2023","unstructured":"Abughazale, B., Abughneim, O.A.: Semi square stable graphs and efficient dominating sets. Trans. Comb. 12, 107\u2013113 (2023)","journal-title":"Trans. Comb."},{"key":"3049_CR2","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/0097-3165(77)90079-6","volume":"23","author":"E Bannai","year":"1977","unstructured":"Bannai, E.: On perfect codes in the Hamming schemes $$H(n, q)$$ with $$q$$ arbitrary. J. Combin. Theory Ser. A 23, 52\u201367 (1977)","journal-title":"J. Combin. Theory Ser. A"},{"key":"3049_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0095-8956(73)90042-7","volume":"15","author":"NL Biggs","year":"1973","unstructured":"Biggs, N.L.: Perfect codes in graphs. J. Combin. Theory Ser. B 15, 289\u2013296 (1973)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3049_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2019.08.004","volume":"271","author":"C \u00c7al\u0131\u015fkan","year":"2019","unstructured":"\u00c7al\u0131\u015fkan, C., Miklavi\u010d, \u0160, \u00d6zkan, S.: Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups. Discrete Appl. Math. 271, 15\u201324 (2019)","journal-title":"Discrete Appl. Math."},{"key":"3049_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.111813","volume":"343","author":"J Chen","year":"2020","unstructured":"Chen, J., Wang, Y., Xia, B.: Characterization of subgroup perfect codes in Cayley graphs. Discrete Math. 343, 111813 (2020)","journal-title":"Discrete Math."},{"key":"3049_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0166-218X(02)00573-5","volume":"129","author":"IJ Dejter","year":"2003","unstructured":"Dejter, I.J., Serra, O.: Efficient dominating sets in Cayley graphs. Discrete Appl. Math. 129, 319\u2013328 (2003)","journal-title":"Discrete Appl. Math."},{"key":"3049_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.dam.2017.07.013","volume":"232","author":"IJ Dejter","year":"2017","unstructured":"Dejter, I.J., Tomaiconza, O.: Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3. Discrete Appl. Math. 232, 116\u2013124 (2017)","journal-title":"Discrete Appl. Math."},{"key":"3049_CR8","unstructured":"Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl 10, (1973)"},{"key":"3049_CR9","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.ipl.2014.06.008","volume":"114","author":"Y-P Deng","year":"2014","unstructured":"Deng, Y.-P.: Efficient dominating sets in circulant graphs with domination number prime. Inform. Process. Lett. 114, 700\u2013702 (2014)","journal-title":"Inform. Process. Lett."},{"key":"3049_CR10","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1016\/j.disc.2017.02.014","volume":"340","author":"Y-P Deng","year":"2017","unstructured":"Deng, Y.-P., Sun, Y.-Q., Liu, Q., Wang, H.-C.: Efficient dominating sets in circulant graphs. Discrete Math. 340, 1503\u20131507 (2017)","journal-title":"Discrete Math."},{"key":"3049_CR11","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1016\/j.disc.2017.02.007","volume":"340","author":"R Feng","year":"2017","unstructured":"Feng, R., Huang, H., Zhou, S.: Perfect codes in circulant graphs. Discrete Math. 340, 1522\u20131527 (2017)","journal-title":"Discrete Math."},{"key":"3049_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0095-8956(75)90087-8","volume":"19","author":"P Hammond","year":"1975","unstructured":"Hammond, P., Smith, D.H.: Perfect codes in the graphs $$O_k$$. J. Combin. Theory Ser. B 19, 239\u2013255 (1975)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3049_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7146\/math.scand.a-11532","volume":"35","author":"O Heden","year":"1974","unstructured":"Heden, O.: Perfect codes in antipodal distance-transitive graphs. Math. Scand. 35, 29\u201337 (1974)","journal-title":"Math. Scand."},{"key":"3049_CR14","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1137\/17M1129532","volume":"32","author":"H Huang","year":"2018","unstructured":"Huang, H., Xia, B., Zhou, S.: Perfect codes in Cayley graphs. SIAM J. Discrete Math. 32, 548\u2013559 (2018)","journal-title":"SIAM J. Discrete Math."},{"key":"3049_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112787","volume":"345","author":"M Jazaeri","year":"2022","unstructured":"Jazaeri, M.: Distance-regular graphs admitting a perfect $$1$$-code. Discrete Math. 345, 112787 (2022)","journal-title":"Discrete Math."},{"key":"3049_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10623-022-01098-0","volume":"91","author":"Y Khaefi","year":"2023","unstructured":"Khaefi, Y., Akhlaghi, Z., Khosravi, B.: On the subgroup perfect codes in Cayley graphs. Des. Codes Cryptogr. 91, 55\u201361 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"3049_CR17","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0095-8956(86)90079-1","volume":"40","author":"J Kratochv\u00edl","year":"1986","unstructured":"Kratochv\u00edl, J.: Perfect codes over graphs. J. Combin. Theory Ser. B 40, 224\u2013228 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3049_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s00373-022-02527-6","volume":"38","author":"YS Kwon","year":"2022","unstructured":"Kwon, Y.S., Lee, J., Sohn, M.Y.: Classification of efficient dominating sets of circulant graphs of degree $$5$$. Graph Combin. 38, 120 (2022)","journal-title":"Graph Combin."},{"key":"3049_CR19","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/jgt.1016","volume":"37","author":"J Lee","year":"2001","unstructured":"Lee, J.: Independent perfect domination sets in Cayley graphs. J. Graph Theory 37, 213\u2013219 (2001)","journal-title":"J. Graph Theory"},{"key":"3049_CR20","doi-asserted-by":"publisher","first-page":"1909","DOI":"10.1137\/19M1258013","volume":"34","author":"X Ma","year":"2020","unstructured":"Ma, X., Walls, G.L., Wang, K., Zhou, S.: Subgroup perfect codes in Cayley graphs. SIAM J. Discrete Math. 34, 1909\u20131921 (2020)","journal-title":"SIAM J. Discrete Math."},{"key":"3049_CR21","volume-title":"The theory of error-correcting codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-Holland, Amsterdam (1977)"},{"key":"3049_CR22","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ipl.2007.02.004","volume":"102","author":"N Obradovi\u0107","year":"2007","unstructured":"Obradovi\u0107, N., Peters, J., Ru\u017ei\u0107, G.: Efficient domination in circulant graphs with two chord lengths. Inform. Process. Lett. 102, 253\u2013258 (2007)","journal-title":"Inform. Process. Lett."},{"key":"3049_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jcta.2001.3188","volume":"97","author":"M Schwartz","year":"2002","unstructured":"Schwartz, M., Etzion, T.: Codes and anticodes in the Grassman graph. J. Combin. Theory Ser. A 97, 27\u201342 (2002)","journal-title":"J. Combin. Theory Ser. A"},{"key":"3049_CR24","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0012-365X(76)90083-2","volume":"15","author":"DH Smith","year":"1976","unstructured":"Smith, D.H.: An improved version of Lloyd\u2019s theorem. Discrete Math. 15, 175\u2013184 (1976)","journal-title":"Discrete Math."},{"key":"3049_CR25","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1017\/S0017089500004146","volume":"21","author":"DH Smith","year":"1980","unstructured":"Smith, D.H.: Perfect codes in the graphs $$O_k$$ and $$L(O_k)$$. Glasgow Math. J. 21, 169\u2013172 (1980)","journal-title":"Glasgow Math. J."},{"key":"3049_CR26","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1016\/j.dam.2012.09.005","volume":"161","author":"T Tamizh Chelvam","year":"2013","unstructured":"Tamizh Chelvam, T., Mutharasu, S.: Subgroups as efficient dominating sets in Cayley graphs. Discrete Appl. Math. 161, 1187\u20131190 (2013)","journal-title":"Discrete Appl. Math."},{"key":"3049_CR27","doi-asserted-by":"publisher","first-page":"22","DOI":"10.2307\/833429","volume":"29","author":"DT Vuza","year":"1991","unstructured":"Vuza, D.T.: Supplementary sets and regular complementary unending canons (part one). Perspect. New Music 29, 22\u201349 (1991)","journal-title":"Perspect. New Music"},{"key":"3049_CR28","unstructured":"Wang, X., Serra, O., Xu, S., Zhou, S.: Perfect codes in circulant graphs of degree $$p^l-1$$. (). arXiv:2403.02205"},{"key":"3049_CR29","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2021.02.006","volume":"864","author":"X Wang","year":"2021","unstructured":"Wang, X., Xu, S., Li, X.: Independent perfect dominating sets in semi-Cayley graphs. Theoret. Comput. Sci. 864, 50\u201357 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"3049_CR30","doi-asserted-by":"crossref","unstructured":"Yang, Y., Lv, B., Wang, K.: Weakly distance-regular digraphs of valency three, I, Electron. J. Combin 23, (2016). (Paper 2.12)","DOI":"10.37236\/5413"},{"key":"3049_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2020.103228","volume":"91","author":"J Zhang","year":"2021","unstructured":"Zhang, J., Zhou, S.: On subgroup perfect codes in Cayley graphs. European J. Combin. 91, 103228 (2021)","journal-title":"European J. Combin."},{"key":"3049_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zhou, S.: Corrigendum to \u201cOn subgroup perfect codes in Cayley graphs\u201d [European J. Combin. 91,: 103228]. European J. Combin. 101(103461), 2022 (2021)","DOI":"10.1016\/j.ejc.2021.103461"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03049-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03049-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03049-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T15:58:35Z","timestamp":1780761515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03049-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,6]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["3049"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03049-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,6]]},"assertion":[{"value":"15 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"55"}}