Name
Abstract | ||
|---|---|---|
Let gamma(D) denote the domination number of a digraph D and let C-m circle times C-n denote the strong product of C-m and C-n, the directed cycles of length m, n = 2. In this paper, we determine the exact values gamma(Cm circle times Cn) = max{[[m/2],[[n/2], [[n/2] m/2]}. Furthermore, we give a lower bound and an upper bound of.(Cm-1 circle times Cm-2 circle times...circle times C-mn) and obtain that gamma(Cm-1 circle times Cm-2 circle times ... C-mn) = max{[[m(1)/2]] [[m(2)/2 ], [[m(2)/2] m(1)/2]} Pi(n)(k= 3) m(k)/2 when at least n-2 integers of {m(1), m(2),..., mn} are even (because of the isomorphism, we assume that m(3), m(4),..., m(n) are even). |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1142/S1793830914500219 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Domination number, strong product, directed cycles | Integer,Discrete mathematics,Combinatorics,Upper and lower bounds,Isomorphism,Domination analysis,Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
6 | 2 | 1793-8309 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huiping Cai | 1 | 0 | 0.68 |
| Juan Liu | 2 | 16 | 6.58 |
| Lingzhi Qian | 3 | 0 | 0.68 |