On domination number of Cartesian product of directed cycles

被引:16
|
作者
Liu, Juan [1 ,2 ]
Zhang, Xindong [2 ]
Chen, Xing [1 ]
Meng, Jixiang [1 ]
机构
[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
[2] Xinjiang Normal Univ, Coll Maths Phys & Informat Sci, Urumqi 830046, Xinjiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Cartesian product; Domination number; Combinatorial problems;
D O I
10.1016/j.ipl.2009.11.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Let gamma(G) denote the domination number of a digraph G and let C-m square C-n denote the Cartesian product of C-m and C-n, the directed cycles of length m, n >= 2. In this paper, we determine the exact values: gamma(C-2 square C-n) = n; gamma(C-3 square C-n) = n if n equivalent to 0 (mod 3), otherwise, gamma(C-3 square C-n) = n + 1: gamma(C-4 square C-n) = 3n/2 if n equivalent to 0 (mod 8), otherwise, gamma(C-4 square C-n) = n + inverted right perpendicularn+1/2inverted left perpendicular. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:171 / 173
页数:3
相关论文
共 50 条