stability and some results of triple effect domination

Let g = (v,e) be a graph without isolated vertices. a subset d ⊆ v is a triple effect dominating set if every vertex in d dominates exactly three vertices of v −d. the triple effect domination number γte(g) is the minimum cardinality of overall triple effect dominating sets in g. in this paper, the triple effect domination number γte(g) is studied to be changing or not after adding or deleting edge or deleting vertex. some conditions are put on the graph to be affected or not with several results and examples. then, the triple effect domination and its inverse are applied on several graphs obtained from complement, join and corona operations.