On the Domination Polynomials of Friendship Graphs

Saeid Alikhani, Jason Brown, Somayeh Jahari

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