A characterization of trees with unique minimum double dominating sets

被引：0

作者：

Chellali, Mustapha ^{[1
]}

Haynes, Teresa W. ^{[2
]}

机构：

[1] Univ Blida, Dept Math, Blida, Algeria

[2] E Tennessee State Univ, Dept Math, Johnson City, TN 37614 USA

来源：

UTILITAS MATHEMATICA | 2010年 / 83卷

关键词：

GRAPHS;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a double dominating set if every vertex of V is dominated at least twice by the vertices of S. We give a constructive characterization of trees with unique minimum double dominating sets.

引用

页码：233 / 242

页数：10

共 11 条

[1] Characterizations of trees with equal paired and double domination numbers [J].

Blidia, Mostafa ;

Chellali, Mustapha ;

Haynes, Teresa W. .

DISCRETE MATHEMATICS, 2006, 306 (16) :1840-1845

[2]

Blidia M, 2006, UTILITAS MATHEMATICA, V70, P159

[3]

Chellali M, 2005, UTILITAS MATHEMATICA, V67, P161

[4]

Chellali M, 2004, ARS COMBINATORIA, V73, P3

[5]

Chellali M., 2005, Discussiones Mathematicae Graph Theory, V25, P291, DOI 10.7151/dmgt.1282

[6]

Gunther G., 1994, C NUMER, V101, P55

[7]

Harary F, 2000, ARS COMBINATORIA, V55, P201

[8]

Haynes T. W., 2002, Discussiones Mathematicae Graph Theory, V22, P233, DOI 10.7151/dmgt.1172

[9]

Haynes T.W., 1998, Chapman & Hall/CRC Pure and Applied Mathematics

[10]

Haynes TW, 1998, Fundamentals of domination in graphs, V1st, DOI [DOI 10.1201/9781482246582, 10.1201/9781482246582]

← 1 2 →