Abstract:
A dominating set S ⊆ V (G)of a graph G is called restrained dominating set if every vertex in V (G) - S is adjacent to a vertex in S and to a vertex in V (G) - S. The restrained domination number of G, denoted by γ_r (G), is the minimum cardinality of a restrained dominating set of G.
