Paired domination in graphs: A survey and recent results

被引：0
作者：
Desormeaux, Wyatt J. [1 ]
Henning, Michael A. [1 ]
机构：
[1] Univ Johannesburg, Dept Math, ZA-2006 Auckland Pk, South Africa
来源：
UTILITAS MATHEMATICA | 2014年 / 94卷
基金：
新加坡国家研究基金会;
关键词：
Paired dominating set; paired domination number; matching number; FREE CUBIC GRAPHS; CLAW-FREE GRAPHS; PERMUTATION GRAPHS; TIME ALGORITHM; PLANAR GRAPHS; UPPER-BOUNDS; TREES; NUMBER; PARAMETERS; DIAMETER;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number of G. This paper presents a survey of selected results on paired domination through 2013.
引用
收藏
页码：101 / 166
页数：66
相关论文
共 95 条
[41]  
Goddard W, 2002, J GRAPH THEOR, V40, P1, DOI 10.1002/jgt.10027
[42]   A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order [J].
Goddard, Wayne ;
Henning, Michael A. .
GRAPHS AND COMBINATORICS, 2009, 25 (05) :675-692
[43]  
Harary F., 1969, Graph Theory
[44]  
Haynes T.W., 1998, Chapman & Hall/CRC Pure and Applied Mathematics
[45]  
Haynes T.W., 1995, C NUM, P65
[46]  
Haynes TW, 2006, UTILITAS MATHEMATICA, V71, P3
[47]  
Haynes TW, 2005, ARS COMBINATORIA, V76, P169
[48]  
Haynes TW, 1998, NETWORKS, V32, P199, DOI 10.1002/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO
[49]  
2-F
[50]  
Haynes TW, 1998, Fundamentals of domination in graphs, V1st, DOI [DOI 10.1201/9781482246582, 10.1201/9781482246582]
12345678910