A subset W \(\subseteq\) V (G) of a graph G is an independent semitotal dominating set G, abbreviated ISTd-set if and every element exactly distance 2 from at least one other W. The domination number denoted by \(\gamma\)it2(G), the minimum cardinality G. In this paper, we study concept in graphs investigate conditions for on which ISTd-sets exist. Further, join any two are examined. Consequent...