Some New Approaches for Computation of Domination Polynomial of Specific Graphs

Let G=(V,E) be a simple graph. The domination polynomial of G is the polynomial D (G, x)=?ni=0 d (G, i) xi, where d (G, i) is the number of dominating sets of G of size I. In this paper, we present some new approaches for computation of domination polynomial of specific graphs.