A minimal edge cut is an total dominating set of a graph that is not a proper subset of any other total dominating set.
Every minimum total dominating set is a minimal total dominating set, but the converse does not necessarily hold.
A minimal edge cut is an total dominating set of a graph that is not a proper subset of any other total dominating set.
Every minimum total dominating set is a minimal total dominating set, but the converse does not necessarily hold.
Weisstein, Eric W. "Minimal Total Dominating Set." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MinimalTotalDominatingSet.html