{'fraction_non_alphanumeric': 0.021653543307086614, 'fraction_numerical': 0.003937007874015748, 'mean_word_length': 3.894230769230769, 'pattern_counts': {'":': 0, '<': 2, '<?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 some properties of partial dominating sets

A subset of the vertex set of a graph is a dominating set of the graph if that subset and all the adjacent vertices of that subset form the whole of the vertex set. In case, if a subset and all the adjacent vertices of that subset form part of the whole set, say, for 0 < p < 1, ptimes of the whole vertex set, we say it is a partial domination. In this paper, we explore some of the properties of partial dominating sets with respect to particular values of p.