Sciweavers

DM
2008
80views more  DM 2008»
13 years 11 months ago
Restrained bondage in graphs
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
Johannes H. Hattingh, Andrew R. Plummer