English

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

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