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.