• NEIGHBORHOOD CONNECTED TWO OUT DEGREE EQUITABLE DOMINATION NUMBER FOR SOME STANDARD GRAPHS

Abstract

Let G= (V, E) be a connected graph. A two out degree equitable dominating set D of a graph G is called the neighborhood connected two out degree equitable dominating set (nc2oe-set) if the induced sub graph <N(D)> is connected. The minimum cardinality of a neighborhood connected two out degree equitable dominating set is called neighborhood connected two out degree equitable domination number of G and is denoted by . In this paper we initiate a study of this parameter and we are going find for some standard graphs.