Domination and independence subdivision numbers of graphs

The domination subdivision number sd∞(G) of a graph is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number. Arumugam showed that this number is at most three for any tree, and conjectured that the upper bound of three holds for any graph. Although we do not prove this interesting conjecture, we give an upper bound for the domination subdivision number for any graph G in terms of the minimum degrees of adjacent vertices in G. We then define the independence subdivision number sdfl(G) to equal the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the independence number. We show that for any graph G of order n ‚ 2, either G = K1;m and sdfl(G) = m, or 1 • sdfl(G) • 2. We also characterize the graphs G for which sdfl(G) = 2.