Complementary total domination in graphs

被引：5

作者：

Chaluvaraju, B. ^{[1
]}

Soner, N. D. ^{[2
]}

机构：

[1] Bangalore Univ, Cent Coll Campus, Dept Math, Bangalore 560001, Karnataka, India

[2] Univ Mysore, Dept Math, Mysore 570006, Karnataka, India

来源：

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY | 2007年 / 10卷 / 04期

关键词：

Graphs; domination; total domination; complementary total domination;

D O I：

10.1080/09720529.2007.10698135

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let D be a minimum total dominating set of G. If V - D contains a total dominating set (TDS) say S of G, then S is called a complementary total dominating set with respect to D. The complementary total domination number gamma(ct)(G) of G is the minimum number of vertices in a complementary total dominating set (CTDS) of G. In this paper, exact values of gamma(ct)(G) for some standard graphs are obtained. Also its relationship with other domination related parameters are investigated.

引用

页码：505 / 516

页数：12

共 13 条

[1] TOTAL DOMINATION IN GRAPHS [J].

COCKAYNE, EJ ;

DAWES, RM ;

HEDETNIEMI, ST .

NETWORKS, 1980, 10 (03) :211-219

[2] THE DIAMETER OF DOMINATION K-CRITICAL GRAPHS [J].

FAVARON, O ;

SUMNER, DP ;

WOJCICKA, E .

JOURNAL OF GRAPH THEORY, 1994, 18 (07) :723-734

[3]

Favaron O., 1988, C NUMER, V66, P316

[4]

Godsil C., 2010, ALGEBRAIC GRAPH THEO

[5]

Haemers Wilhelmus Hubertus, 1980, THESIS, V121

[6]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[7]

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

[8]

Haynes T.W., 1998, FUNDAMENTALS DOMINAT

[9]

Janakiram B., 2002, FAR E J APPL MATH, V6, P89

[10]

KULLI VR, 1991, NATL ACAD SCI LETT, V14, P473

← 1 2 →