A short proof of a result on a Vizing-like problem for integer total domination

被引：1

作者：

Henning, Michael A. ^{[1
]}

机构：

[1] Univ KwaZulu Natal, Sch Math Sci, ZA-3209 Pietermaritzburg, South Africa

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2010年 / 20卷 / 03期

基金：

新加坡国家研究基金会;

关键词：

Integer total domination; Total domination; Cartesian product; GRAPHS;

D O I：

10.1007/s10878-008-9201-x

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this note, we provide a short proof of a recent result on a Vizing-like problem for integer total domination in graphs given by Li and Hou (J. Comb. Optim., 2008).

引用

页码：321 / 323

页数：3

共 5 条

[1] A short proof of a result on a Vizing-like problem for integer total domination
Michael A. Henning
Journal of Combinatorial Optimization, 2010, 20 : 321 - 323
[2] On integer domination in graphs and vizing-like problems
Bresar, Bostjan
Henning, Michael A.
Klavzar, Sandi
TAIWANESE JOURNAL OF MATHEMATICS, 2006, 10 (05): : 1317 - 1328
[3] A linear vizing-like relation relating the size and total domination number of a graph
Henning, MA
JOURNAL OF GRAPH THEORY, 2005, 49 (04) : 285 - 290
[4] Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
Henning, Michael A.
Joubert, Ernst J.
DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2014 - 2024
[5] A linear Vizing-like relation relating the size and total domination number of a graph (vol 49, pg 285, 2005)
Shan, Erfang
Kang, Liying
Henning, Michael A.
JOURNAL OF GRAPH THEORY, 2007, 54 (04) : 350 - 353

← 1 →