The upper domination number Γ(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as the minimum size of a dominating set of vertices in G (Burger et al. 1997, Mynhardt and Roux 2020).

dominating set | domination number | domination polynomial