Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brešar B, Henning MA, Klavžar S (2006) On integer domination in graphs and Vizing-like problems. Taiwan J Math 10:1317–1328
Goddard W, Henning MA (1999) Real and integer domination in graphs. Discrete Math 199:61–75
Henning MA, Rall DF (2005) On the total domination number of Cartesian products of graph. Graphs Comb 21:63–69
Ho PT (2008) A note on the total domination number. Util Math (to appear)
Li N, Hou X (2008) On the total {k}-domination number of Cartesian products of graphs. J Comb Optim. Published online
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal.
Rights and permissions
About this article
Cite this article
Henning, M.A. A short proof of a result on a Vizing-like problem for integer total domination. J Comb Optim 20, 321–323 (2010). https://doi.org/10.1007/s10878-008-9201-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-008-9201-x