Cubic Graphs with Total Domatic Number at Least Two

Saieed Akbari, Mohammad Motiei, Sahand Mozaffari +1

Let $G$ be a graph. A total dominating set of $G$ is a set $S$ of vertices of $G$ such that every vertex is adjacent to at least one vertex in $S$. The total domatic number of a gr…