Efficient dominating sets in Cayley graphs. (Q1406027)

An independent set \(C\) of vertices in a graph is called an efficient dominating set if each vertex not in \(C\) is adjacent to exactly one vertex in \(C\). Efficient dominating sets are also called perfect codes. An \(E\)-chain is a countable family of nested graphs, each of which has an efficient dominating set. The authors give a constructing tool to produce \(E\)-chains of Cayley graphs. Using this tool infinite families of \(E\)-chains of Cayley graphs on symmetric groups are constructed.