Domination Polynomials of the Grid, the Cylinder, the Torus, and the King Graph

We present an algorithm to compute the domination polynomial of the $m\times n$ grid, cylinder, and torus graphs and the king graph. The time complexity of the algorithm is $O(m^2{n}^2{\lambda }^{2m})$ for the torus and $O(m^3{n}^2{\lambda }^m)$ for the other graphs, where $\lambda =1+\sqrt{2}$. The space complexity is $O(mn{\lambda }^m)$ for all of these graphs. We use this algorithm to compute domination polynomials for graphs up to size $24\times 24$ and the total number of dominating sets for even larger graphs. This allows us to give precise estimates of the asymptotic growth rates of the number of dominating sets. We also extend several sequences in the Online Encyclopedia of Integer Sequences.