On the domination polynomials of cactus chains

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=\sum_{i=γ(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $γ(G)$ is the domination number of $G$. In this paper we consider cactus chains with triangular and square blocks and study their domination polynomials.

No reviews yet.

No comments yet.