Abstract
Motivated by the concept of reverse signed domination, we introduce the reverse minus domination problem on graphs and study the problem from the algorithmic point of view. For strongly chordal graphs and distance-hereditary graphs, we show that the reverse minus domination problem can be solved in polynomial time. We also show that the problem is 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
