CONNECTED COTOTAL DOMINATION NUMBER OF A GRAPH

A dominating setD V of a graphG = (V;E) is said to be a connected cototal dominating set ifhDi is connected andhV Di6= ?, contains no isolated vertices. A connected cototal dominating set is said to be minimal if no proper subset of D is connected cototal dominating set. The connected cototal domination number ccl(G) of G is the minimum cardinality of a minimal connected cototal dominating set of G. In this paper, we begin an investigation of connected cototal domination number and obtain some interesting results.