2018/07/21 by Pahlavsay, Behnaz, Palezzato, Elisa, Torielli, Michele
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1807.08104
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 γ× k,t(G). We give a constructive proof of a general formula for γ× 3, t(Kn \Box Km).