Title of article :
complexity of the paired domination subdivision problem
Author/Authors :
amjadi, jafar azarbaijan shahid madani university - department of mathematics, tabriz, iran , chellali, mustapha university of blida - lamda-ro laboratory, department of mathematics, blida, algeria
Abstract :
the paired domination subdivision number of a graph g is the minimum number of edges that must be subdivided (where each edge in g can be subdivided at most once) in order to increase the paired domination number of g. in this note, we show that the problem of computing the paired domination subdivision number is np-hard for bipartite graphs.
Keywords :
paired domination , paired domination subdivision number , complexity
Journal title :
Communications in Combinatorics and Optimization
Journal title :
Communications in Combinatorics and Optimization
