Vaidya, S.K.; Ajani, P.D.
(Journal of Scientific Research, 2021)
For a graph G=(V, E), a set S⊆ V (S⊆ E) is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in V-S (ES). The ...