{'fraction_non_alphanumeric': 0.01627906976744186, 'fraction_numerical': 0.0, 'mean_word_length': 4.986111111111111, '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}}
A Taxonomy of Perfect Domination

Abstract A variety of terminology has been used in the literature to describe a dominating set with the property that each vertex in graph is dominated exactly once (or at most once, depending on the situation). We review the various terminologies related to perfect domination, consider some of the variations of perfect domination studied in the literature, and survey some of the main results.