Restrained Double Domination Number of a Graph

被引：0

作者：

Kala, R. ^{[1
]}

Vasantha, T. ^{[2
]}

机构：

[1] Manonmaniam Sundaranar Univ, Dept Math, Tirunelveli 627012, Tamil Nadu, India

[2] Coll Holy Cross, Dept Math, Nagercoil 629004, Tamil Nadu, India

来源：

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2008年 / 5卷 / 01期

关键词：

Domination; Double domination; Restrained domination; Restrained double domination; Restrained double domination number;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A set S subset of V(G) is a restrained double dominating set for G if every vertex in V is dominated by at least two vertices in S and V-S has no isolated vertices. The minimum cardinality of a minimal restrained double dominating set is the restrained double domination number and is denoted by gamma(2r)(G). In this paper we initiate a study of this parameter and obtain some bounds for gamma(2r)(G) and characterize the graphs attaining these bounds. We also derive Nordhaus-Gaddum type results for gamma(2r)(G).

引用

页码：73 / 82

页数：10

共 7 条

[1]

Cyman J, 2006, AUSTRALAS J COMB, V36, P91

[2] Restrained domination in graphs [J].

Domke, GS ;

Hattingh, JH ;

Hedetniemi, ST ;

Laskar, RC ;

Markus, LR .

DISCRETE MATHEMATICS, 1999, 203 (1-3) :61-69

[3]

Harary F., 1972, GRAPH THEORY

[4]

Harary F., PREPRINT

[5]

Haynes T. W., 1998, FUNDAMENTALS DOMINAT, V28

[6]

Kala R., TAMKANG J MATH

[7] For vertex partitioning problems on partial k-trees [J].

Telle, JA ;

Proskurowski, A .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 1997, 10 (04) :529-550

← 1 →