A minimum total dominating set is a total dominating set of a graph that is of smallest possible size. In other words, it is a total dominating set with size equal to the total domination number.
Every minimum total dominating set is a minimal total dominating set, but the converse does not necessarily hold.
