Advertisement

Journal of Combinatorial Optimization

, Volume 20, Issue 3, pp 321–323 | Cite as

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

  • Michael A. Henning
Article

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).

Keywords

Integer total domination Total domination Cartesian product 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brešar B, Henning MA, Klavžar S (2006) On integer domination in graphs and Vizing-like problems. Taiwan J Math 10:1317–1328 MATHGoogle Scholar
  2. Goddard W, Henning MA (1999) Real and integer domination in graphs. Discrete Math 199:61–75 CrossRefMathSciNetMATHGoogle Scholar
  3. Henning MA, Rall DF (2005) On the total domination number of Cartesian products of graph. Graphs Comb 21:63–69 CrossRefMathSciNetMATHGoogle Scholar
  4. Ho PT (2008) A note on the total domination number. Util Math (to appear) Google Scholar
  5. Li N, Hou X (2008) On the total {k}-domination number of Cartesian products of graphs. J Comb Optim. Published online Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.School of Mathematical SciencesUniversity of KwaZulu-NatalPietermaritzburgSouth Africa

Personalised recommendations