Bounds on Global Total Domination in Graphs

被引：0

作者：

Rad, Nader Jafari ^{[1
]}

Sharifi, Elahe ^{[1
]}

机构：

[1] Shahrood Univ Technol, Dept Math, Shahrood, Iran

来源：

COMPUTER SCIENCE JOURNAL OF MOLDOVA | 2015年 / 23卷 / 01期

关键词：

Domination; Total domination; Global total domination;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A subset S of vertices in a graph G is a global total dominating set, or just GTDS, if S is a total dominating set of both G and (G) over bar. The global total domination number gamma(gt)(G) of G is the minimum cardinality of a GTDS of G. We present bounds for the global total domination number in graphs.

引用

页码：3 / 10

页数：8

共 13 条

[1]

Arumugam S, 2009, ARS COMBINATORIA, V93, P175

[2]

Brigham R. C., 2000, J COMBIN COMPUT COMB, V34, P81

[3]

Brigham RC, 1998, MG TXB PUR APPL MATH, V209, P301

[4]

Carrington J. R., 1992, C NUMER, V88, P161

[5] TOTAL DOMINATION IN GRAPHS [J].

COCKAYNE, EJ ;

DAWES, RM ;

HEDETNIEMI, ST .

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

[6] On global domination critical graphs [J].

Dutton, Ronald D. ;

Brigham, Robert C. .

DISCRETE MATHEMATICS, 2009, 309 (19) :5894-5897

[7]

Enciso Rosa I., 2008, Journal of Combinatorial Mathematics and Combinatorial Computing, V66, P273

[8]

Haynes T. W., 1998, FUNDAMENTALS DOMINAT

[9]

Henning M. A., 2013, TOTAL DOMINATION GRA

[10]

Kulli VR, 1996, INDIAN J PURE AP MAT, V27, P537

← 1 2 →