• CONNECTED REGULAR DOMINATION NUMBER OF A GRAPH G

Abstract

The connected dominating set was first suggested by S. T. Hedetniemi and elabourate treatment of this parameter appears in E. Sampathkumar and H. B. Walikar [5]. The concept of regular domination was first introduced by prof. E. Sampathkumar. On combining these two parameters we obtain a new parameter namely connected regular domination as, let G be  a graph, V is a vertex set of G and D  V, then D is said to be connected regular domination, if it satisfies the following conditions, (i) D is Dominating set (ii) D is regular (iii) D is connected. In this paper, we find the connected regular domination number for complete graph and for some standard graphs.