Discussiones Mathematicae - Graph Theory, cilt.42, sa.3, ss.823-841, 2022 (SCI-Expanded)
© 2020 Cafer Caliskan et al.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.