A study of some domination parameters of undirected power graphs of Cyclic groups
Abstract
In this paper we study some domination parameters of undirected power graph on cyclic sub-semi groups. An undirected graph (S) for a semigroup S as follows.Let us denote the cyclic sub-semi group generated by a ∈ S by , that is, , = {am | m ∈ N}, where N denotes the set of natural numbers. The graph (S) is an undirected graph whose vertex set is S and two vertices a, b ∈ S are adjacent if and only if a b and or (which is equivalent to say a b and or for some positive integer m).We obtain the domination, total domination and clique domination numbers for this graph.
