3-Tuple Total Domination Number of Rook’s Graphs
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...
| Published in: | Discussiones Mathematicae Graph Theory |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2022-02-01
|
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2242 |