K-domination number of products of two directed cycles and two directed paths

2018 ◽  
Vol 9 (2) ◽  
pp. 197
Author(s):  
Ramy Shaheen
Keyword(s):  
Domination Number ◽  
Directed Paths ◽  
Directed Cycles

THE DOMINATION NUMBER OF STRONG PRODUCT OF DIRECTED CYCLES

2014 ◽  
Vol 06 (02) ◽  
pp. 1450021
Author(s):  
HUIPING CAI ◽  
JUAN LIU ◽  
LINGZHI QIAN
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Domination Number ◽  
Strong Product ◽  
Directed Cycles

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).

Domination number of Cartesian products of directed cycles

2010 ◽  
Vol 111 (1) ◽  
pp. 36-39 ◽  
Author(s):  
Xindong Zhang ◽  
Juan Liu ◽  
Xing Chen ◽  
Jixiang Meng
Keyword(s):  
Domination Number ◽  
Cartesian Products ◽  
Directed Cycles

On domination number of Cartesian product of directed paths

2010 ◽  
Vol 22 (4) ◽  
pp. 651-662 ◽  
Author(s):  
Juan Liu ◽  
Xindong Zhang ◽  
Jixiang Meng
Keyword(s):  
Domination Number ◽  
Cartesian Product ◽  
Directed Paths

scholarly journals On the Domination Number of Cartesian Product of Two Directed Cycles

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Zehui Shao ◽  
Enqiang Zhu ◽  
Fangnian Lang
Keyword(s):  
Upper Bound ◽  
Domination Number ◽  
Cartesian Product ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Dynamic Algorithm ◽  
Directed Cycles

Denote byγ(G)the domination number of a digraphGandCm□Cnthe Cartesian product ofCmandCn, the directed cycles of lengthm,n≥2. In 2010, Liu et al. determined the exact values ofγ(Cm□Cn)form=2,3,4,5,6. In 2013, Mollard determined the exact values ofγ(Cm□Cn)form=3k+2. In this paper, we give lower and upper bounds ofγ(Cm□Cn)withm=3k+1for different cases. In particular,⌈2k+1n/2⌉≤γ(C3k+1□Cn)≤⌊2k+1n/2⌋+k. Based on the established result, the exact values ofγ(Cm□Cn)are determined form=7and 10 by the combination of the dynamic algorithm, and an upper bound forγ(C13□Cn)is provided.

On domination number of Cartesian product of directed cycles

2010 ◽  
Vol 110 (5) ◽  
pp. 171-173 ◽  
Author(s):  
Juan Liu ◽  
Xindong Zhang ◽  
Xing Chen ◽  
Jixiang Meng
Keyword(s):  
Domination Number ◽  
Cartesian Product ◽  
Directed Cycles

scholarly journals More Results on the Domination Number of Cartesian Product of Two Directed Cycles

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 210 ◽  
Author(s):  
Ansheng Ye ◽  
Fang Miao ◽  
Zehui Shao ◽  
Jia-Bao Liu ◽  
Janez Žerovnik ◽  
...  
Keyword(s):  
Graph Theory ◽  
Applied Mathematics ◽  
Domination Number ◽  
Cartesian Product ◽  
Equivalence Classes ◽  
Cartesian Products ◽  
Directed Cycles

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 = 3 k + 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.

Sign in / Sign up

Export Citation Format

Share Document