• COMPLEMENTARY TREE EQUITABLE DOMINATION NUMBER OF A GRAPH

Abstract

Let G = (V, E) be a graph. A set D Í V (G) is equitable dominating set of G if " v Î V – D $ a vertex u Î D such that uv Î E (G) and |d(u) – d(v)| £ 1. A set D Í V (G) is outer equitable dominating set if D is equitable dominating and  <V – D> is connected graph. The outer equitable connected domination number of G is the minimum cardinality of the outer-equitable connected dominating set of G and is denoted byg_oec(G). In this paper we introduce the concept of complementary tree equitable domination, exact values for some particular classes of graphs are found, some results on complementary tree equitable domination number are also established.