Domination Subdivision and Domination Multisubdivision Numbers of Graphs

• Main Authors: Dettlaff Magda, Raczek Joanna, Topp Jerzy
• Format: Article
• Language: English
• Published: Sciendo 2019-11-01
• Series: Discussiones Mathematicae Graph Theory
• Subjects: domination; domination subdivision number; domination multisubdivision number; trees; computational complexity; 05c69; 05c05; 05c99
• Online Access: https://doi.org/10.7151/dmgt.2103

The 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 increase the domination number of G. It has been shown [10] that sd(T) ≤ 3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number of a nonempty graph G as a minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. We show that msd(G) ≤ 3 for any graph G. The domination subdivision number and the domination multisubdivision number of a graph are incomparable in general, but we show that for trees these two parameters are equal. We also determine the domination multisubdivision number for some classes of graphs.