On the Total Domination Number of Cartesian Products of Graphs |
| |
Authors: | Michael A Henning Douglas F Rall |
| |
Institution: | (1) School of Mathematics, Statistics, & Information Technology, University of KwaZulu-Natal, Pietermaritzburg, 3209, South Africa;(2) Department of Mathemtics, Furman University, Greenville, SC 29613, USA |
| |
Abstract: | 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.Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal |
| |
Keywords: | Graph products Total domination Vizing s conjecture" target="_blank">gif" alt="rsquo" align="BASELINE" BORDER="0">s conjecture |
本文献已被 SpringerLink 等数据库收录! |
|