|
|
Definition of Dominating set
1. 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. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Dominating Set
Other Resources:
