• CONNECTED TWO- OUT DEGREE EQUITABLE DOMINATION NUMBER IN DIFFERENT GRAPHS

Abstract

Let G=(V,E) be a graph. A dominating set D in V of  a graph G is called two out degree  equitable dominating set if for any two vertices u, v D, The minimum cardinality of a two-out degree equitable dominating set is called two-out degree equitable domination number, and is denoted by (G). An two-out degree equitable dominating set D is said to be connected two-out degree equitable dominating set if the sub graph <D> induced by D is connected. The minimum cardinality of connected two –out degree dominating set is called connected two out degree equitable domination number and is denoted by (G).  In this paper we introduce the connected two-out degree equitable domination number and connected two-out degree equitable domatic in graphs and its exact values for some standard graphs.