A set X is weakly convex in G if for any two vertices a, b ∈ X there exists an ab-geodesic such that all of its vertices belong to X. A set X ⊆ V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number γ wcon (G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd γwcon (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 weakly convex domination number. In this paper we initiate the study of weakly convex domination subdivision number and establish upper bounds for it.
Study of weakly convex domination subdivision number and its upper bounds is presented in REF .
Weakly convex domination subdivision number of a graph
Filomat
Mathematics