On domination of Cartesian product of directed cycles
Michel Mollard (IF)

TL;DR
This paper investigates the domination number of the Cartesian product of directed cycles, providing new exact values for specific cases, improving bounds for others, and disproving a previously conjectured formula.
Contribution
It determines the domination number for cases where m ≡ 2 (mod 3), improves lower bounds for remaining cases, and refutes a conjecture for m ≡ 0 (mod 3).
Findings
Exact values for γ(C_m □ C_n) when m ≡ 2 (mod 3)
Improved lower bounds for most remaining cases
Disproof of the conjectured formula for m ≡ 0 (mod 3)
Abstract
Let be the domination number of the Cartesian product of directed cycles and for . Shaheen [] and Liu and al.[ ], [ ] determined the value of when and when both and . In this article we give, in general, the value of when and improve the known lower bound for most of the remaining cases. We also disprove the conjectured formula for the case appearing in \cite{}
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · graph theory and CDMA systems · Advanced Graph Theory Research
