Abstract
Let γ {k} t (G) denote the total {k}-domination number of graph G, and let \(G\mathbin{\square}H\) denote the Cartesian product of graphs G and H. In this paper, we show that for any graphs G and H without isolated vertices, \(\gamma _{t}^{\{k\}}(G)\gamma _{t}^{\{k\}}(H)\le k(k+1)\gamma _{t}^{\{k\}}(G\mathbin{\square}H)\) . As a corollary of this result, we have \(\gamma _{t}(G)\gamma _{t}(H)\le 2\gamma _{t}(G\mathbin{\square}H)\) for all graphs G and H without isolated vertices, which is given by Pak Tung Ho (Util. Math., 2008, to appear) and first appeared as a conjecture proposed by Henning and Rall (Graph. Comb. 21:63–69, 2005).
Similar content being viewed by others
References
Bres̆ar B (2005) Vizing-like conjecture for the upper domination of Cartesian products of graphs—the proof. Electron J Combin 12:N12, 6 pp
Bres̆ar B, Henning MA, Klavz̆ar S (2006) On integer domination in graphs and Vizing-like problems. Taiwan J Math 10:1317–1328
Cockayne EJ, Dawes RM, Hedetniemi ST (1980) Total domination in graphs. Networks 10:211–219
Clark WE, Suen S (2000) An inequality related to Vizing’s conjecture. Electron J Combin 7(1):N4, 3 pp (electronic)
Tung Ho P (2008) A note on the total domination number. Util Math (to appear)
Hou X (2007) Total domination of Cartesian products of graphs. Discuss Math Graph Theory 27:175–178
Nowakowski RJ, Rall DF (1996) Associative graph products and their independence, domination and coloring numbers. Discuss Math Graph Theory 16:53–79
Henning MA, Rall DF (2005) On the total domination number of Cartesian products of graphs. Graph Comb 21:63–69
Henning MA, Rall DF (2007) On the upper total domination number of Cartesian products of graphs. J Comb Optim (online)
Vizing VG (1968) Some unsolved problems in graph theory. Usp. Mat. Nauk 23(6(144)):117–134
Author information
Authors and Affiliations
Corresponding author
Additional information
The work was supported by NNSF of China (No. 10701068 and No. 10671191).
Rights and permissions
About this article
Cite this article
Li, N., Hou, X. On the total {k}-domination number of Cartesian products of graphs. J Comb Optim 18, 173–178 (2009). https://doi.org/10.1007/s10878-008-9144-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-008-9144-2