3-Tuple Total Domination Number of Rook's Graphs

被引:3
作者
Pahlavsay, Behnaz [1 ]
Palezzato, Elisa [1 ]
Torielli, Michele [2 ]
机构
[1] Hokkaido Univ, Dept Math, Kita Ku, Kita 10,Nishi 8, Sapporo, Hokkaido 0600810, Japan
[2] Hokkaido Univ, GI CoRE GSB, Dept Math, Kita Ku, Kita 10,Nishi 8, Sapporo, Hokkaido 0600810, Japan
关键词
k-tuple total domination; Cartesian product of graphs; rook's graph; Vizing's conjecture; CARTESIAN PRODUCTS; INTEGER DOMINATION;
D O I
10.7151/dmgt.2242
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A k-tuple total dominating set (kTDS) of a graph G is a set S of vertices in which every vertex in G is adjacent to at least k vertices in S. The minimum size of a kTDS is called the k-tuple total dominating number and it is denoted by gamma(xk,t)(G). We give a constructive proof of a general formula for gamma(x3)(,t)(KnKm).
引用
收藏
页码:15 / 37
页数:23
相关论文
共 23 条
[1]  
[Anonymous], 1998, FUNDAMENTALS DOMINAT, DOI 10.1201/9781482246582
[2]  
[Anonymous], 2008, GRAPH THEORY
[3]  
[Anonymous], 2000, WIL INT S D
[4]  
Bresar B, 2007, UTILITAS MATHEMATICA, V73, P255
[5]  
Bresar B, 2006, TAIWAN J MATH, V10, P1317
[6]   Vizing's conjecture: a survey and recent results [J].
Bresar, Bostjan ;
Dorbec, Paul ;
Goddard, Wayne ;
Hartnell, Bert L. ;
Henning, Michael A. ;
Klavzar, Sandi ;
Rall, Douglas F. .
JOURNAL OF GRAPH THEORY, 2012, 69 (01) :46-76
[7]  
Burchett P.A., 2009, C NUMER, V199, P187
[8]  
Burchett P.A., 2011, C NUMER, V209, P179
[9]   Integer domination of Cartesian product graphs [J].
Choudhary, K. ;
Margulies, S. ;
Hicks, I. V. .
DISCRETE MATHEMATICS, 2015, 338 (07) :1239-1242
[10]  
Choudhary K, 2013, ELECTRON J COMB, V20