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

Michael A. Henning ()
Additional contact information
Michael A. Henning: University of KwaZulu-Natal

Journal of Combinatorial Optimization, 2010, vol. 20, issue 3, No 7, 323 pages

Abstract: 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 (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9201-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:20:y:2010:i:3:d:10.1007_s10878-008-9201-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-008-9201-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().