2022/07/29 by Guichard, David R.
#05C69 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2208.00004
We use a dynamic programming algorithm to establish a new lower bound on the domination number of complete cylindrical grid graphs of the form Cn\square Pm, that is, the Cartesian product of a path and a cycle, when n≡ 2\pmod5, and we establish a new upper bound equal to the lower bound, thus computing the exact domination number for these graphs.