Changing and unchanging of the domination number of a graph

Let G be a graph and γ(G) denote the domination number of G. A dominating set D of a graph G with |D|=γ(G) is called a γ-set of G. A vertex x of a graph G is called: (i) γ-fixed if x belongs to every γ-set, (ii) γ-free if x belongs to some γ-set but not to all γ-sets, (iii) γ-bad if x belongs to no γ-set, (iv) γ^--free if x is γ-free and γ(G-x)=γ(G)-1, (v) γ⁰-free if x is γ-free and γ(G-x)=γ(G), and (vi) γ^q-fixed if x is γ-fixed and γ(G-x)=γ(G)+q. In this paper we investigate for any vertex x of a graph G whether x is γ^q-fixed, γ⁰-free, γ^--free or γ-bad when G is modified by deleting a vertex or adding or deleting an edge.