Dominating-set Definition

noun
(graph theory) A set of vertices of a graph, such that each vertex in that graph is either in that set or adjacent to some vertex in that set.
Wiktionary
Advertisement