• 2-EQUITABLE CO-INDEPENDENT DOMINATION OF A GRAPH

Abstract

Let G = (V, E) be a undirected graph. A dominating set  is said to be equitable dominating set if for every , there exists a vertex  such that  and where deg(u) is the degree of u and deg(v) is the degree of v in G. An equitable dominating set D is said to be connected if the sub graph  induced by D is connected. The minimum cardinalities of the connected equitable dominating sets of G is denoted by .  An equitable dominating set D of a graph G is called 2-equitable dominating set if for any vertex v in G either or v is equitable dominated by at least 2 vertices in D. The minimum cardinality of a 2-equitable dominating set of G is called 2-equitable domination number of G and is denoted by  In   this paper,             2-equitable co-independent domination in a graph and connected 2-equitable co-independent domination in a graph is introduced and studied.