A minimal total dominating set is an total dominating set of a graph that does not contain any other total dominating set as a proper subset.
Every minimum total dominating set is a minimal total dominating set, but the converse does not necessarily hold.
