{'fraction_non_alphanumeric': 0.018363939899833055, 'fraction_numerical': 0.0, 'mean_word_length': 5.0606060606060606, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On the Complexity of Reverse Minus Domination on Graphs

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.