A dominating set S ⊆ V is said to be a restrained dominating set of graph G if every vertex not in S is adjacent to a vertex in S and also to a vertex in V − S. A set S ⊆ V is called an equitable dominating set if for ...