On total domination in the Cartesian product of graphs
Combinatorics
2016-12-30 v2
Abstract
Ho proved in [A note on the total domination number, Util.Math. 77 (2008) 97--100] that the total domination number of the Cartesian product of any two graphs with no isolated vertices is at least one half of the product of their total domination numbers. We extend a result of Lu and Hou from [Total domination in the Cartesian product of a graph and or , Util. Math. 83 (2010) 313--322] by characterizing the pairs of graphs and for which , whenever . In addition, we present an infinite family of graphs with , which asymptotically approximate the equality in .
Keywords
Cite
@article{arxiv.1607.01909,
title = {On total domination in the Cartesian product of graphs},
author = {Boštjan Brešar and Tatiana Romina Hartinger and Tim Kos and Martin Milanič},
journal= {arXiv preprint arXiv:1607.01909},
year = {2016}
}
Comments
11 pages, 3 figures