Some More Results On Neighborhood Connected Two Out Degree Equitable Domination Number Of Graphs

For any graph G, the out degree of a vertex v with respect to D is denoted by and it is defined by). A sub set D of V(G) is said to be two out degree equitable dominating set if D is dominating set and for any two vertices such that The minimum number of vertices in two out degree equitable dominating set is called two out degree equitable domination number and it is denoted by Based on the above concept of out degree we introduce a new domination parameter called neighborhood connected two out degree equitable domination number and study this domination number for some standard graphs In this paper the proposed domination number verified for some new special graphs and semitotal point graph of some general graphs.