the convex domination subdivision number of a graph

Let g=(v,e) be a simple graph. a set d⊆v is a dominating set of g if every vertex in v∖d has at least one neighbor in d. the distance dg(u,v) between two vertices u and v is the length of a shortest (u,v)-path in g. an (u,v)-path of length dg(u,v) is called an (u,v)- geodesic. a set x⊆v is convex in g if vertices from all (a,b)-geodesics belong to x for any two vertices a,b∈x. a set x is a convex dominating set if it is convex and dominating set. the {em convex domination number} γcon(g) of a graph g equals the minimum cardinality of a convex dominating set in g. the convex domination subdivision number} sdγcon (g) is the minimum number of edges that must be subdivided (each edge in g can be subdivided at most once) in order to increase the convex domination number. in this paper we initiate the study of convex domination subdivision number and we establish upper bounds for it.