Domination polynomials of k-tree related graphs

S. Jahari, S. Alikhani

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G,x)={\sum }_{i=\gamma (G)}^{n}d(G,i)x^i$, where $d(G,i)$ is the number of dominating sets…