For a graph G, a set D⊆ V (G) is called a [1, j]-dominating set if every vertex in V (G)∖ D has
at least one and at most j neighbors in D. A set D⊆ V (G) is called a [1, j]-total dominating set …