In this paper, sharp upper bounds for the domination number, total domination number and connected domination number for the Cayley graph G = Cay(D2n, Ω) const
Let G be a finite nilpotent group of odd order and S be a subset of G{0}. We say that S is complete if every element of G can be represented as a sum of differe