Connected k-tuple twin domination in de Bruijn and Kautz digraphs

被引:6
|
作者
Araki, Toru [1 ]
机构
[1] Gunma Univ, Dept Comp Sci, Gunma 3768515, Japan
关键词
Connected k-tuple twin dominating set; Line digraph; de Bruijn digraph; Kautz digraph; 1-factorization; APPROXIMATION ALGORITHMS; DISK GRAPHS; SETS;
D O I
10.1016/j.disc.2009.05.031
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For a digraph G, a k-tuple twin dominating set D of G for some fixed k >= 1 is a set of vertices such that every vertex is adjacent to at least k vertices in D, and also every vertex is adjacent from at least k vertices in D. If the subgraph of G induced by D is strongly connected, then D is called a connected k-tuple twin dominating set of G. In this paper, we give constructions of minimal connected k-tuple twin dominating sets for de Bruijn digraphs and Kautz digraphs. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:6229 / 6234
页数:6
相关论文
共 50 条