• CONNECTED TWO OUT DEGREE EQUITABLE DOMINATION POLYNOMIAL OF A GRAPH

Abstract

Let G= (V, E) be a connected graph. A dominating set D of G is called connected two out degree equitable dominating set if for any u,v such that and the induced sub graph<D> is connected. The minimum cardinality of connected two out degree equitable dominating set is called connected two out degree equitable domination number and it is denoted by In this paper we introduce the connected two out degree equitable domination polynomial of G. The connected two out degree equitable domination polynomial of connected graph G of order p is the polynomial, where is the number of connected two out degree equitable dominating set of G of size i and is the connected two out degree equitable domination number and we compute this polynomial and its roots for some standard graphs.