Perfect codes in Cayley graphs

He Huang, Binzhou Xia, Sanming Zhou

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 $…