arXiv:1205.5537 [math.CO]AbstractReferencesReviewsResources
On domination of Cartesian product of directed cycles
Published 2012-05-24Version 1
Let $\gamma(C_m\Box C_n)$ be the domination number of the Cartesian product of directed cycles $C_m$ and $C_n$ for $m,n\geq2$. Shaheen [] and Liu and al.[ ], [ ] determined the value of $\gamma(C_m\Box C_n)$ when $m \leq 6$ and when both $m$ and $n$ $\equiv 0$ $(mod\: 3)$. In this article we give, in general, the value of $\gamma(C_m\Box C_n)$ when $m\equiv 2$ $(mod\: 3)$ and improve the known lower bound for most of the remaining cases. We also disprove the conjectured formula for the case $m$ $\equiv 0$ $(mod\: 3)$ appearing in \cite{}
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1811.01639 [math.CO] (Published 2018-11-05)
A general lower bound for the domination number of cylindrical graphs
arXiv:1008.2250 [math.CO] (Published 2010-08-13)
Colouring the Square of the Cartesian Product of Trees
arXiv:1504.05012 [math.CO] (Published 2015-04-20)
Polynomials vanishing on Cartesian products: The Elekes-Szabó Theorem revisited