Algorithms for the Global Domination Problem

Ernesto Parra Inza, Nodari Vakhania, Jose M. Sigarreta Almira +1

A dominating set D in a graph G is a subset of its vertices such that every vertex of the graph which does not belong to set D is adjacent to at least one vertex from set D. A set…