Abstract
Denote by the domination number of a digraph and the Cartesian product of and , the directed cycles of length . In 2010, Liu et al. determined the exact values of for . In 2013, Mollard determined the exact values of for . In this paper, we give lower and upper bounds of with for different cases. In particular, . Based on the established result, the exact values of are determined for and 10 by the combination of the dynamic algorithm, and an upper bound for is provided.
Citation
Zehui Shao. Enqiang Zhu. Fangnian Lang. "On the Domination Number of Cartesian Product of Two Directed Cycles." J. Appl. Math. 2013 1 - 7, 2013. https://doi.org/10.1155/2013/619695