A dominating set D ⊆ V (G) of a simple graph G is the set of all u such that for every v ∈ V (G)\D, uv ∈ E(G). An independent set I ⊆ V (G) is a set of non-adjacent vertices in G. An independent dominating set Di ⊆ V (G) ...