  In this paper we present a lower bound for the domination number of the
Cartesian product of a path and a cycle, that is tight if the length of the
cycle is a multiple of five. This bound improves the natural lower bound
obtained by using the domination number of the Cartesian product of two paths,
that is the best one known so far.
