Complementary equitably totally disconnected equitable domination in graphs

In a simple, finite and undirected graph G with vertex set V and edge set E, a subset S of V (G) is said to be a degree equitable dominating set if for every v is an element of V - S there exists a vertex u is an element of S such that uv is an element of E(G) and vertical bar deg(u) - deg(v)vertical bar <= 1, where deg(u) denotes the degree of u in G. The minimum cardinality of such a dominating set is denoted by gamma(e) and is called the equitable domination number of G. In this paper, we introduce Complementary Equitably Totally Disconnected Equitable domination in graphs and obtain some interesting results. Also, we discuss some bounds of this new domination parameter.