pith. sign in

arxiv: 1807.08104 · v1 · pith:6VHS2VS3new · submitted 2018-07-21 · 🧮 math.CO

3-tuple total domination number of rook's graphs

classification 🧮 math.CO
keywords totaltupledominatinggammanumbertimesverticesadjacent
0
0 comments X
read the original abstract

A $k$-tuple total dominating set ($k$TDS) 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 $k$TDS is called the $k$-tuple total dominating number and it is denoted by $\gamma_{\times k,t}(G)$. We give a constructive proof of a general formula for $\gamma_{\times 3, t}(K_n \Box K_m)$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.