A dominating set S of a graph G of order n is a subset of the vertices of G such that every vertex is either in S or adjacent to a vertex of S. The domination polynomial of G, denoted D(G, x), is the generating polynomial ...