Efficient total dominating sets in cayley graphs
Abstract
A fundamental result of J. Lee relates efficient dominating sets in Cayley graphs to covers of a complete graph. We show that the same methods can be used to relate efficient total dominating sets in Cayley graphs to covers of a reflexive complete graph. A further link is made to efficient dominating sets and efficient total dominating sets in Cayley graphs.











