A short proof of a result on a Vizing-like problem for integer total domination
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).
KeywordsInteger total domination Total domination Cartesian product
Unable to display preview. Download preview PDF.
© Springer Science+Business Media, LLC 2008