On the Domination Number of Cartesian Product of Two Directed Cycles

Zehui Shao, Enqiang Zhu and Fangnian Lang

Journal of Applied Mathematics, 2013, vol. 2013, 1-7

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.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2013/619695.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2013/619695.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:619695

DOI: 10.1155/2013/619695

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().