Subgroup Perfect Codes of $\mathcal{A}_t$-Groups and Their Applications
Combinatorics
2025-07-22 v1
Abstract
A subset of the vertex set of a graph is called a perfect code in if every vertex of is at distance no more than 1 to exactly one vertex of . A subgroup of a group is called a subgroup perfect code of if is a perfect code in some Cayley graph of . Recently, Zhang reveals that the study of subgroup perfect codes of finite groups naturally reduces to the case of -groups, especially -groups. Based on the combined works of Berkovich, Janko and Zhang, every -group is an -group. In this work, we establish a complete classification of subgroup perfect codes of -groups for . Moreover, subgroup perfect codes of finite groups with abelian Sylow -subgroups are also characterized.
Keywords
Cite
@article{arxiv.2507.15206,
title = {Subgroup Perfect Codes of $\mathcal{A}_t$-Groups and Their Applications},
author = {Huye chen and Binbin Li and Jingjian Li and Hao Yu},
journal= {arXiv preprint arXiv:2507.15206},
year = {2025}
}