Let be the domination number of a graph and let denote the Cartesian product of graphs and . The authors prove that , where and all , are multiples of . The methods they use to prove this result immediately lead to an algorithm for finding minimum dominating sets of the considered graphs. Furthermore the domination numbers of products of two cycles are determined exactly if one factor is equal to or , respectively.
