On the Complexity of Reverse Minus and Signed Domination on Graphs

Abstract

Motivated by the concept of reverse signed domination, we introduce the reverse minus domination problem on graphs, and study the reverse minus and signed domination problems from the algorithmic point of view. In this paper, we show that both the reverse minus and signed domination problems are polynomial-time solvable for strongly chordal graphs and distance-hereditary graphs, and are linear-time solvable for trees. For chordal graphs and bipartite planar graphs, however, we show that the decision problem corresponding to the reverse minus domination problem is NP-complete. For doubly chordal graphs and bipartite planar graphs, we show that the decision problem corresponding to the reverse signed domination problem is NP-complete. Furthermore, we show that even when restricted to bipartite planar graphs or doubly chordal graphs, the reverse signed domination problem is not fixed parameter tractable.