Journal
GRAPHS AND COMBINATORICS
Volume 21, Issue 1, Pages 63-69Publisher
SPRINGER TOKYO
DOI: 10.1007/s00373-004-0586-8
Keywords
graph products; total domination; Vizing's conjecture
Categories
Ask authors/readers for more resources
The most famous open problem involving domination in graphs is Vizing's conjecture which states the domination number of the Cartesian product of any two graphs is at least as large as the product of their domination numbers. In this paper, we investigate a similar problem for total domination. In particular, we prove that the product of the total domination numbers of any nontrivial tree and any graph without isolated vertices is at most twice the total domination number of their Cartesian product, and we characterize the extremal graphs.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available