Perfect codes in circulant graphs

Rongquan Feng, He Huang, Sanming Zhou

A perfect code in a graph $\Gamma =(V,E)$ is a subset $C$ of $V$ that is an independent set such that every vertex in $V\setminus C$ is adjacent to exactly one vertex in $C$. A total…