co-even domination number of a modified graph by operations on a vertex or an edge

Let g = (v,e) be a simple graph. a dominating set of g is a subset d ⊆ v such that every vertex not in d is adjacent to at least one vertex in d. the cardinality of a smallest dominating set of g, denoted by γ(g), is the domination number of g. a dominating set d is called co-even dominating set if the degree of vertex v is even number for all v ∈ v d. the cardinality of a smallest co-even dominating set of g, denoted by γcoe(g), is the co-even domination number of g. in this paper, we study the co-even domination number of graphs which constructed by some operations on a vertex or an edge of a graph.