TOTAL k-DISTANCE DOMINATION CRITICAL GRAPHS

被引：0

作者：

Mojdeh, D. A. ^{[1
,2
]}

Sayed-Khalkhali, A. ^{[2
]}

Ahangar, H. Abdollahzadeh ^{[3
]}

Zhao, Y. ^{[4
]}

机构：

[1] Univ Mazandaran, Dept Math, Babol Sar, Iran

[2] Univ Tafresh, Dept Math, Tafresh, Iran

[3] Babol Univ Technol, Dept Basic Sci, Babol Sar, Iran

[4] Wuxi City Coll Vocat Technol, Dept Basic Sci, Wuxi 214153, Jiangsu, Peoples R China

来源：

TRANSACTIONS ON COMBINATORICS | 2016年 / 5卷 / 03期

关键词：

Distance domination; total k-distance dominating set; total k-distance domination-critical;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A set S of vertices in a graph G = (V, E) is called a total k-distance dominating set if every vertex in V is within distance k of a vertex in S. A graph G is total k-distance domination-critical if gamma(k)(t)(G - x) < gamma(k)(t)(G) for any vertex x is an element of V (G). In this paper, we investigate some results on total k-distance domination-critical of graphs.

引用

页码：1 / 9

页数：9

共 12 条

[1]

Bondy JA, 2008, GRADUATE TEXTS MATH, V244

[2] The diameter of total domination vertex critical graphs [J].

Goddard, W ;

Haynes, TW ;

Henning, MA ;

van der Merwe, LC .

DISCRETE MATHEMATICS, 2004, 286 (03) :255-261

[3]

Haynes T. W., 1998, MONOGRAPHS TXB PURE, V208

[4]

Henning M. A., 1991, J COMBINATORICS INFO, V16, P11

[5]

Khodkar A., 2007, B I COMBIN APPL, V49, P61

[6]

MOJDEH DA, 2006, ELECT NOTES DISCRETE, V24, P89

[7] On an open problem concerning total domination critical graphs [J].

Mojdeh, Doost Ali ;

Rad, Nader Jafari .

EXPOSITIONES MATHEMATICAE, 2007, 25 (02) :175-179

[8]

RAD NJ, 2008, APPL MATH SCI, V2, P2025

[9] On the existence problem of the total domination vertex critical graphs [J].

Sohn, Moo Young ;

Kim, Dongseok ;

Kwon, Young Soo ;

Lee, Jaeun .

DISCRETE APPLIED MATHEMATICS, 2011, 159 (01) :46-52

[10] Distance domination-critical graphs [J].

Tian, Fang ;

Xu, Jun-Ming .

APPLIED MATHEMATICS LETTERS, 2008, 21 (04) :416-420

← 1 2 →