Domination subdivision and domination multisubdivision numbers of graphs

Magda Dettlaff, Joanna Raczek, Jerzy Topp

The \emph{domination subdivision number} sd$(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to in…