Perfect codes in circulant graphs of degree $p^l-1$

Xiaomeng Wang, Oriol Serra, Shou-Jun Xu +1

A perfect code in a graph is an independent set of the graph such that every vertex outside the set is adjacent to exactly one vertex in the set. A circulant graph is a Cayley grap…