Vaidya, S. K.; Ajani, P D
(International Journal of Mathematics and Soft Computing, 2018)
For a graph G = (V, E), 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 smallest cardinality of a restrained
dominating set of G is called ...