The (lower) domination number of a graph is the minimum size of a dominating set of vertices in , i.e., the size of a minimum dominating set. This is equivalent to the smallest size of a minimal dominating set since every minimum dominating set is also minimal.