• DEGREE EQUITABLE CONNECTED CO-TOTAL DOMINATION NUMBER OF GRAPH

Abstract

Let  be any connected graph. A subset D of V is called a connected dominating set of G if every vertex  is adjacent to some vertex in D and  is connected. A connected dominating set D is said to be degree equitable connected co-total dominating set if for every vertex  there exist a vertex  such that           and    provided  contains no isolated vertices. The minimum cardinality of degree equitable connected co-total dominating set is called degree equitable connected co-total domination number and it is denoted by . In this paper, we have obtained the  of some standard class of graphs and further established some bounds for