Paired-domination in claw-free graphs with minimum degree at least three
Paired-domination in claw-free graphs with minimum degree at least three
复制标题
无爪图中的成对支配，最小度至少为 3
DOI：
10.1016/j.dam.2018.09.005
复制
发表时间：
2019-03
影响因子：
1.1
通讯作者：
Wu Yana
中科院分区：
文献类型：
--
作者：
Lu Changhong;Wang Bing;Wang Kan;Wu Yana
Abstract Let G=(V, E) be a simple graph without isolated vertices. A set S⊆ V is called a paired-dominating set if every vertex in V∖ S has at least one neighbor in S and the subgraph induced by S contains a perfect matching. The paired-domination number of G, denoted by γ p r (G), is the minimum cardinality of a paired-dominating set of G. We show that γ p r (G)≤ 4 n∕ 7 if G is a claw-free graph of order n with minimum degree at least three. The statement partly confirms the conjecture proposed by Goddard and Henning in 2009.
登录
查看更多内容
影响因子：
1
作者：
Paul Dorbec;Michael A. Henning
通讯作者：
Paul Dorbec;Michael A. Henning
影响因子：
1
作者：
Chen, Lei;Lu, Changhong;Zeng, Zhenbing
通讯作者：
Zeng, Zhenbing
影响因子：
1
作者：
Michael A. Henning
通讯作者：
Michael A. Henning
影响因子：
0.7
作者：
W. Goddard;Michael A. Henning
通讯作者：
W. Goddard;Michael A. Henning
影响因子：
0.7
作者：
O. Favaron;Michael A. Henning
通讯作者：
O. Favaron;Michael A. Henning