{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,11]],"date-time":"2026-09-11T01:33:27Z","timestamp":1789090407572,"version":"build-2803163510"},"reference-count":32,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP150101066"],"award-info":[{"award-number":["DP150101066"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT110100629"],"award-info":[{"award-number":["FT110100629"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Given a graph $\\Gamma$, a subset $C$ of $V(\\Gamma)$ is called a perfect code in $\\Gamma$ if every vertex of $\\Gamma$ is at distance no more than one to exactly one vertex in $C$, and a subset $C$ of $V(\\Gamma)$ is called a total perfect code in $\\Gamma$ if every vertex of $\\Gamma$ is adjacent to exactly one vertex in $C$. In this paper we study perfect codes and total perfect codes in Cayley graphs, with a focus on the following themes: when a subgroup of a given group is a (total) perfect code in a Cayley graph of the group; and how to construct new (total) perfect codes in a Cayley graph from known ones using automorphisms of the underlying group. We prove several results around these questions.<\/jats:p>","DOI":"10.1137\/17m1129532","type":"journal-article","created":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T13:09:36Z","timestamp":1519304976000},"page":"548-559","source":"Crossref","is-referenced-by-count":60,"title":["Perfect Codes in Cayley Graphs"],"prefix":"10.1137","volume":"32","author":[{"given":"He","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Binzhou","family":"Xia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanming","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,2,22]]},"reference":[{"key":"atypb1","first-page":"254","volume":"1","author":"Baer R.","year":"1935","journal-title":"Compositio Math."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(77)90079-6"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(73)90042-7"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01110066"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00573-5"},{"key":"atypb6","unstructured":"P. Delsarte,\n                      An Algebraic Approach to the Association Schemes of Coding Theory\n                      , Philips Res. Rep. Suppl. 10, 1973."},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.06.008"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.02.014"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104445794"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(87)80004-5"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.02.007"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01180974"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(75)90087-8"},{"key":"atypb14","doi-asserted-by":"crossref","unstructured":"T. W. Haynes, S. T. Hedetniemi, and P. Slater,\n                      Fundamentals of Domination in Graphs\n                      . Marcel Dekker, New York, 1998.","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2008.2.223"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90079-1"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.1016"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.03.013"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903126"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023733"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.02.004"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.12.003"},{"key":"atypb23","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1215\/ijm\/1255455741","volume":"4","author":"Schenkman E.","year":"1960","journal-title":"Illinois J. Math."},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3188"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1017\/S0017089500004146"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1137\/05063828X"},{"key":"atypb27","doi-asserted-by":"crossref","unstructured":"S. Szabo\u0301 and A. Sands,\n                      Factoring Groups into Subsets\n                      . CRC Press, Boca Raton, FL, 2009.","DOI":"10.1201\/9781420090475"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.09.005"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2003.12.001"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1216\/RMJ-1975-5-2-199"},{"key":"atypb31","unstructured":"S. Zhou,\n                      Cyclotomic Graphs and Perfect Codes\n                      , submitted, 2015,http:\/\/arxiv.org\/abs\/1502.03272."},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0169-0"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1129532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:54:09Z","timestamp":1787316849000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1129532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1129532"],"URL":"https:\/\/doi.org\/10.1137\/17m1129532","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}