{'fraction_non_alphanumeric': 0.019656019656019656, 'fraction_numerical': 0.0, 'mean_word_length': 4.828571428571428, '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}}
GENERALIZED DEGREE DISTANCE OF TREES, UNICYCLIC AND BICYCLIC GRAPHS

A generalization of degree distance of graphs we recently proposed as a new topological index. In this paper, the new index is studied in trees, in unicyclic graphs of girth k and in some special classes of bicyclic graphs. Lower-bound and upper-bound values and analytical formulasto calculate this index in the studied graphs are given.