Let G = (V, E) be a simple graph. A subset D of V is said to be a dominating set of G, if each vertex in V is either in D or has a neighbour in D. A subset D of V is said to be an equitable dominating set of G, if for every ...