A set D ⊆ V of a graph G = (V,E) is called a restrained dominating set of G if every vertex not in D is adjacent to a vertex in D and to a vertex in V \ D. The MINIMUM RESTRAINED DOMINATION problem is to find a restrained ...