DISTANCE k-DOMINATION IN SOME CYCLE RELATED GRAPHS

被引：0

作者：

Vaidya, S. K. ^{[1
]}

Kothari, N. J. ^{[2
]}

机构：

[1] Saurashtra Univ, Dept Math, Rajkot 360005, Gujarat, India

[2] LE Coll Diploma, Gen Dept, Morbi 363642, Gujarat, India

来源：

MISKOLC MATHEMATICAL NOTES | 2018年 / 19卷 / 02期

关键词：

dominating set; domination number; distance domination; splitting graph; R-DOMINATION; NUMBER;

D O I：

10.18514/MMN.2018.1163

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper we determine distance k-domination number of graph obtained by duplication of vertices altogether by edges in cycle C-n, splitting graph of cycle C-n as well as graph obtained by duplication of edges altogether by vertices in cycle C-n.

引用

页码：1223 / 1231

页数：9

共 13 条

[1] Graphs having distance-n domination number half their order [J].

Fischermann, M ;

Volkmann, L .

DISCRETE APPLIED MATHEMATICS, 2002, 120 (1-3) :97-107

[2] ON THE R-DOMINATION NUMBER OF A GRAPH [J].

GRIGGS, JR ;

HUTCHINSON, JP .

DISCRETE MATHEMATICS, 1992, 101 (1-3) :65-72

[3]

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

[4]

Henning M.A., 1991, J. Combin. Inform. System Sci, V16, P11

[5]

Henning MA, 1998, MG TXB PUR APPL MATH, V209, P321

[6]

Klobucar A., 2005, Mathematica Slovaca, V55, P141

[7] R-DOMINATION IN GRAPHS [J].

SLATER, PJ .

JOURNAL OF THE ACM, 1976, 23 (03) :446-450

[8] Bounds on the distance two-domination number of a graph [J].

Sridharan, N ;

Subramanian, VSA ;

Elias, MD .

GRAPHS AND COMBINATORICS, 2002, 18 (03) :667-675

[9]

Tian F, 2009, AUSTRALAS J COMB, V43, P181

[10] Average distances and distance domination numbers [J].

Tian, Fang ;

Xu, Jun-Ming .

DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) :1113-1127

← 1 2 →