{'fraction_non_alphanumeric': 0.018229166666666668, 'fraction_numerical': 0.0, 'mean_word_length': 4.422535211267606, '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}}
MATCHING DOMINATION IN FUZZY LABELING TREE

A matching is a set of non-adjacent edges. If every vertex of fuzzy graph is M-saturated then the matching is said to be complete or perfect. In this paper, we introduce the new concept of Global matching domination in fuzzy labeling tree and its spanning sub graph. We discussed some properties using these concepts in Fuzzy labeling tree.