Dominating set
（重定向自Domination number）
![](/Images/godic/202501/09/Dominating-set.svg3839.png")
![](/Images/godic/202501/09/Dominating-set-reduction.svg3839.png")
In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G.