Domination and independence subdivision numbers of graphs
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 …