Efficient domination in Cayley graphs of generalized dihedral groups

Abstract

An independent subset D of the vertex set V of the graph is an effcient dominating set for this graph if each vertex v in 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 effcient dominating set.