A total dominating set in a graph
is a set of vertices of
such that every vertex is adjacent to a vertex of the set. The total domination number
is the minimum cardinality of a total dominating set in
. In this paper, we study the following open problem posed by Yeo. For each
, find the smallest value,
...