The domination number of strong product of directed cycles (Q2875686)

The domination number of the Cartesian product of directed cycles and paths has been discussed in the literature. There are some related works for the strong product of two graphs or digraphs. The paper obtains the domination number for the strong product of two directed cycles. In addition, it gives a lower bound and an upper bound of the domination number for the strong product of \(n\) directed cycles, and obtains the exact value when at least \(n - 2\) of these \(n\) integers are even.