{'fraction_non_alphanumeric': 0.014124293785310734, 'fraction_numerical': 0.005649717514124294, 'mean_word_length': 4.298507462686567, '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}}
ON THE LARGEST EIGENVALUE OF THE DISTANCE MATRIX OF A TREE

The largest eigenvalue Λ1 of the distance matrix of a tree has been proposed as a structure–descriptor. We provide upper and lower bounds for Λ1 in terms of the number of vertices, the sum of the squares of the distances between all unordered pairs of vertices, or the Wiener index of the tree.