• CONNECTED DOMINATING SETS AND CONNECTED DOMINATION POLYNOMIALS OF

Abstract

Let G be a simple connected graph.  The connected domination polynomial of G is defined by

C_d(G,x) = c_d(G,i)xⁱ ,

where (G) is the connected domination number of G. In this paper, we find the connected dominating sets of and a recursive formula is obtained. Also, we construct the connected domination polynomial of  and some interesting properties between the coefficients are also obtained.