THE DOMINATION NUMBER OF STRONG PRODUCT OF DIRECTED CYCLES
2014 ◽
Vol 06
(02)
◽
pp. 1450021
Let γ(D) denote the domination number of a digraph D and let Cm ⊗ Cn denote the strong product of Cm and Cn, the directed cycles of length m, n ≥ 2. In this paper, we determine the exact values [Formula: see text] Furthermore, we give a lower bound and an upper bound of γ(Cm1 ⊗ Cm2 ⊗ ⋯ ⊗ Cmn) and obtain that [Formula: see text] when at least n-2 integers of {m1, m2, …, mn} are even (because of the isomorphism, we assume that m3, m4, …, mn are even).
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
1998 ◽
Vol 58
(1)
◽
pp. 1-13
◽
Keyword(s):
Limit Cycle Bifurcations for Piecewise Smooth Hamiltonian Systems with a Generalized Eye-Figure Loop
2016 ◽
Vol 26
(12)
◽
pp. 1650204
◽
Keyword(s):
1953 ◽
Vol 49
(1)
◽
pp. 59-62
◽
Keyword(s):