The Domination Number of C n □ P m for n ≡ 2 ( mod 5 )

Abstract

We use a dynamic programming algorithm to establish a new lower bound on the domination number of complete cylindrical grid graphs of the form C n □ P m , that is, the Cartesian product of a path and a cycle, when n ≡ 2 ( mod 5 ) , and we establish a new upper bound equal to the lower bound, thus computing the exact domination number for these graphs.