Domination polynomial of clique cover product of graphs

Somayeh Jahari, Saeid Alikhani

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