arXiv Analytics

Sign in

arXiv:1607.01909 [math.CO]AbstractReferencesReviewsResources

On total domination in the Cartesian product of graphs

Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos, Martin Milanič

Published 2016-07-07Version 1

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 $K_2$ or $C_n$, Util. Math. 83 (2010) 313--322] by characterizing the pairs of graphs $G$ and $H$ for which $\gamma_t(G\Box H)=\frac{1}{2}\gamma_t(G) \gamma_t(H)\,$, whenever $\gamma_t(H)=2$. In addition, we present an infinite family of graphs $G_n$ with $\gamma_t(G_n)=2n$, which asymptotically approximate the equality in $\gamma_t(G_n\Box G_n)\ge \frac{1}{2}\gamma_t(G_n)^2$.

Comments: 10 pages, 3 figures
Categories: math.CO
Subjects: 05C69
Related articles: Most relevant | Search more
arXiv:1508.02594 [math.CO] (Published 2015-08-11)
On the safe set of Cartesian product of two complete graphs
arXiv:1504.01975 [math.CO] (Published 2015-04-08)
On the b-chromatic number of the Cartesian product of two complete graphs
arXiv:1806.04628 [math.CO] (Published 2018-06-12)
The Game of Zombies and Survivors on the Cartesian Products of Trees