On subgroup perfect codes in vertex-transitive graphs

Binzhou Xia, Junyang Zhang, Zhishuo Zhang

A subset $C$ of the vertex set $V$ of a graph $\hat{I}“$ is called a perfect code in $\hat{I}“$ if every vertex in $V\setminus C$ is adjacent to exactly one vertex in $C$. Given a group $G$ an…