Characterization of subgroup perfect codes in Cayley graphs

Jiyong Chen, Yanpeng Wang, Binzhou Xia

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than $1$ to exactly one vertex of $C$. A subset $C$ of a…