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

Research output: Contribution to journalArticlepeer-review

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

Original languageEnglish
Pages (from-to)321-323
Number of pages3
JournalJournal of Combinatorial Optimization
Volume20
Issue number3
DOIs
Publication statusPublished - Oct 2010
Externally publishedYes

Keywords

  • Cartesian product
  • Integer total domination
  • Total domination

ASJC Scopus subject areas

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A short proof of a result on a Vizing-like problem for integer total domination'. Together they form a unique fingerprint.

Cite this