<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>More results on the domination number of Cartesian product of two directed cycles</dc:title><dc:creator>Ye,	Ansheng	(Avtor)
	</dc:creator><dc:creator>Miao,	Fang	(Avtor)
	</dc:creator><dc:creator>Shao,	Zehui	(Avtor)
	</dc:creator><dc:creator>Liu,	Jia-Bao	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:creator>Repolusk,	Polona	(Avtor)
	</dc:creator><dc:subject>domination number</dc:subject><dc:subject>Cartesian product</dc:subject><dc:subject>directed cycle</dc:subject><dc:description>Let γ(D) denote the domination number of a digraph D and let C$_m$□C$_n$ denote the Cartesian product of C$_m$ and C$_n$, the directed cycles of length n ≥ m ≥ 3. Liu et al. obtained the exact values of γ(C$_m$□C$_n$) for m up to 6 [Domination number of Cartesian products of directed cycles, Inform. Process. Lett. 111 (2010) 36–39]. Shao et al. determined the exact values of γ(C$_m$□C$_n$) for m = 6, 7 [On the domination number of Cartesian product of two directed cycles, Journal of Applied Mathematics, Volume 2013, Article ID 619695]. Mollard obtained the exact values of γ(C$_m$□C$_n$) for m = 3k + 2 [M. Mollard, On domination of Cartesian product of directed cycles: Results for certain equivalence classes of lengths, Discuss. Math. Graph Theory 33(2) (2013) 387–394.]. In this paper, we extend the current known results on C$_m$□C$_n$ with m up to 21. Moreover, the exact values of γ(C$_n$□C$_n$) with n up to 31 are determined. </dc:description><dc:date>2019</dc:date><dc:date>2021-10-07 12:09:32</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>131962</dc:identifier><dc:identifier>UDK: 519.1</dc:identifier><dc:identifier>ISSN pri članku: 2227-7390</dc:identifier><dc:identifier>DOI: 10.3390/math7020210</dc:identifier><dc:identifier>COBISS_ID: 24462088</dc:identifier><dc:language>sl</dc:language></metadata>
