Remarks about disjoint dominating sets

被引：27
作者：
Henning, Michael A. [2 ]
Loewenstein, Christian [1 ]
Rautenbach, Dieter [1 ]
机构：
[1] Tech Univ Ilmenau, Inst Math, D-98684 Ilmenau, Germany
[2] Univ Kwazulu Natal, Sch Math Sci, ZA-3209 Pietermaritzburg, South Africa
来源：
DISCRETE MATHEMATICS | 2009年 / 309卷 / 23-24期
基金：
新加坡国家研究基金会;
关键词：
Domination; Independence; Inverse domination; MINIMUM INTERSECTION; INVERSE DOMINATION; DOMATIC NUMBER; GRAPHS;
D O I：
10.1016/j.disc.2009.06.017
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove several structural and hardness results concerning pairs of disjoint sets in graphs which are dominating or independent and dominating. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：6451 / 6458
页数：8
相关论文
共 16 条
[1]  
Bange D.W., 1978, C NUMER, V21, P101
[2]   On minimum intersection of two minimum dominating sets of interval graphs [J].
Chang, MS ;
Hsu, CC .
DISCRETE APPLIED MATHEMATICS, 1997, 78 (1-3) :41-50
[3]  
Cockayne E. J., 1977, Networks, V7, P247, DOI 10.1002/net.3230070305
[4]  
Dankelmann P, 2004, ARS COMBINATORIA, V73, P247
[5]  
Domke GS, 2004, ARS COMBINATORIA, V72, P149
[6]  
Eades P., 1996, Nordic Journal of Computing, V3, P220
[7]  
Feige U, 2003, SIAM J COMPUT, V32, P172
[8]  
FRENDRUP A, ARS COMBIN IN PRESS
[9]   ON MINIMUM DOMINATING SETS WITH MINIMUM INTERSECTION [J].
GRINSTEAD, DL ;
SLATER, PJ .
DISCRETE MATHEMATICS, 1990, 86 (1-3) :239-254
[10]  
Haynes T.W., 2013, Fundamentals of domination in graphs, DOI DOI 10.1201/9781482246582
12