 Dominating set

In graph theory, a **dominating set** for a graph \( G = (V, E) \) is a subset \( D \subseteq V \) of the vertices such that every vertex not in \( D \) is adjacent to at least one vertex in \( D \).