Minimum Dominating Set

Keyword: MinDomSet

The domination number of a graph G is the minimum cardinality of a set of vertices such that every vertices is either in the set or is a neighbor of a vertex in the set.