The connected complement domination in graphs

A subset D ⊆ V(G) of a graph G = (V, E) is said to be connected complement domination set of G if D is connected domination set of G and dominating set of . The connected complement domination number is the minimum cardinality taken over all connected complement dominating sets of G and is denoted by . In this paper, are obtained for some standard graphs.