A New Lower Bound for the Domination Number of Complete Cylindrical Grid Graphs

We use a dynamic programming algorithm to establish a lower bound on the domination number of complete grid graphs of the form $C_n\mathrm{\square }{P}_m$, that is, the Cartesian product of a cycle $C_n$ and a path $P_m$, for $m$ and $n$ sufficiently large.