Characterization of subgroup perfect codes in Cayley graphs (Q2305927): Difference between revisions

A subset \(C\) of the vertex set of a graph \(G\) is called a perfect code in \(G\) if every vertex of \(G\) is at distance no more than 1 to exactly one vertex of \(C.\) A subset \(C\) of a group \(\Gamma\) is called a perfect code of \(\Gamma\) if \(C\) is a perfect code in some Cayley graph of \(\Gamma\). The perfect codes are also called efficient dominating sets or independent perfect dominating sets in pure graph theoretical terms. In this paper, the authors provide sufficient and necessary conditions for a subgroup \(\Omega\) of a finite group \(\Gamma\) to be a perfect code of \(\Gamma\). Based on this, they provide a characterization for of all finite groups that have no nontrivial subgroup as a perfect code.