Minimum Dominating Set

A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph.

A minimum dominating set is always a minimal dominating set, but the converse does not necessarily hold.

See also

Domination Number, Domination Polynomial, Dominating Set, Minimal Dominating Set

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Minimum Dominating Set." From MathWorld--A Wolfram Web Resource.

Subject classifications