{'fraction_non_alphanumeric': 0.08072916666666667, 'fraction_numerical': 0.0, 'mean_word_length': 3.5833333333333335, '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}}
Min-Max Dom-Saturation Number of a Tree

Let G = (V,E) be a graph and let v ∈ V. Let min (v,G) denote the minimum cardinality of a minimal dominating set of G containing v. Then M,m (G) = max{ min (v,G) : v ∈ V (G)} is called the min-max dom-saturation number of G. In this paper we present a dynamic programming algorithm for determining the min-max dom- saturation number of a tree.