On domination number of Cartesian product of directed cycles

Domination number of Cartesian products of directed cycles

“…This notation turned out to be convenient to formulate the proof of the following results. [11].) Let m 2.…”

“…By Lemma 2.2, we have γ (C 5 C n ) 2n. In [11], we have proved that γ (C 5 C 3 ) = 6 and γ (C 5 C 4 ) = 8. Let n 5.…”

“…For example, γ (C 3 C n ) = n + 1 when n ≡ 0 (mod 3), [11]. In the following, we will show that the upper bound is achieved for the Cartesian product digraph C 6 C n .…”

“…There are many research ar- ticles on the domination number and the related works for Cartesian product of two undirected graphs (see, for example [2][3][4][5][6][7][8][9][10]). However, to date no research has been done for the Cartesian product of two directed graphs except [11]. In [11], we determined the exact values:…”

“…However, to date no research has been done for the Cartesian product of two directed graphs except [11]. In [11], we determined the exact values:…”