EXACT EQUITABLE DOMINATION IN GRAPHS

Abstract

Let  be any graph. An equitable dominating set  in  is said to be an Exact equitable dominating set if  for every  is adjacent to exactly one vertex of  or  is an isolate of That is,  for every  and   for every . The exact equitable domination number  of a graph  is the cardinality of a minimum exact equitable dominating set. In this article, we study the exact equitable domination number for some well-known standard graph and also bounds for Exact equitable domination number.