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
基金
新加坡国家研究基金会;
关键词
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
相关论文
共 9 条