Efficient Domination in Cayley Graphs of Generalized Dihedral Groups

Abstract

An independent subset D of the vertex set V of the graph Gamma is an efficient dominating set for Gamma if each vertex v is an element of V \ D has precisely one neighbour in D. In this article, we classify the connected cubic Cayley graphs on generalized dihedral groups which admit an efficient dominating set.