Efficient Domination in Cayley Graphs of Generalized Dihedral Groups

Abstract

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

Keywords

• efficient domination set
• cayley graph
• generalized dihedral group
• 05c69
• 05e18