Domination polynomials of \(k\)-tree related graphs (Q471790)

Summary: Let \(G\) be a simple graph of order \(n\). The domination polynomial of \(G\) is the polynomial \(D(G,x)=\sum^n_{i=\gamma (G)}d(G,i)x^i\), where \(d(G, i)\) is the number of dominating sets of \(G\) of size \(i\) and \(\gamma (G)\) is the domination number of \(G\). In this paper, we study the domination polynomials of several classes of \(k\)-tree related graphs. Also, we present families of these kinds of graphs, whose domination polynomials have no nonzero real roots.