Vaidya, S. K; Ajani, P. D
(Malaya Journal of Matematik,, 2019)
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 also to a vertex in V − S. The minimum cardinality of a restrained dominating set of G is called ...