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

Abstract: We use a dynamic programming algorithm to establish a lower bound on the domination number of complete grid graphs of the form

C_{n} s q u a r e P_{m}

, that is, the Cartesian product of a cycle

C_{n}

and a path

P_{m}

, for

m

and

n

sufficiently large.

This page was built for publication: A New Lower Bound for the Domination Number of Complete Cylindrical Grid Graphs