- 作者：F. Dahme ; D. Rautenbach ; L. Volkmann
- 关键词：none ; color ; black" href="/science?_ob=MathURL&_method=retrieve&_udi=B6V00-4PDKB1R-1&_mathId=mml32&_user=1067359&_cdi=5632&_rdoc=8&_acct=C000050221&_version=1&_userid=10&md5=3438c484f37cdeac3553e7b01d4c3a8f" ti
- 刊名：Discrete Mathematics
- 出版年：2008
- 期刊代码：47_0012365x
- 类别：cp
- 出版时间：6 August 2008
- 卷：308
- 期：15
- 页码：3187-3198
- 文件大小：236 K
摘要
Let 
(0,1) and let 46ac1732f2999f99b1b81cf3" title="Click to view the MathML source" alt="Click to view the MathML source">G=(VG,EG) be a graph. According to Dunbar et al. [-Domination, Discrete Math. 211 (2000) 11–26], a set D
VG is an -dominating set of G if |NG(u)∩D|
dG(u) for all uVG
D. Similarly, we define a set DVG to be an -independent set of G if |NG(u)∩D|
dG(u) for all uD. The a20a23aa2" title="Click to view the MathML source" alt="Click to view the MathML source">-domination number γ(G) of G is the minimum cardinality of an -dominating set of G and the -independent -domination number i(G) of G is the minimum cardinality of an -dominating set of G that is also -independent. A graph G is -domination perfect if γ(H)=i(H) for all induced subgraphs H of G.
(0,1) and let 46ac1732f2999f99b1b81cf3" title="Click to view the MathML source" alt="Click to view the MathML source">G=(VG,EG) be a graph. According to Dunbar et al. [-Domination, Discrete Math. 211 (2000) 11–26], a set DVG is an -dominating set of G if |NG(u)∩D|dG(u) for all uVGD. Similarly, we define a set DVG to be an -independent set of G if |NG(u)∩D|dG(u) for all uD. The a20a23aa2" title="Click to view the MathML source" alt="Click to view the MathML source">-domination number γ(G) of G is the minimum cardinality of an -dominating set of G and the -independent -domination number i(G) of G is the minimum cardinality of an -dominating set of G that is also -independent. A graph G is -domination perfect if γ(H)=i(H) for all induced subgraphs H of G.