首页 | 本学科首页   官方微博 | 高级检索  
     


On the total {k}-domination number of Cartesian products of graphs
Authors:Ning Li  Xinmin Hou
Affiliation:(1) Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, China
Abstract:Let γ t {k}(G) denote the total {k}-domination number of graph G, and let $Gmathbin{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}}(Gmathbin{square}H)$ . As a corollary of this result, we have $gamma _{t}(G)gamma _{t}(H)le 2gamma _{t}(Gmathbin{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). The work was supported by NNSF of China (No. 10701068 and No. 10671191).
Keywords:Total {k}-domination  Total domination  Cartesian product
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号