{'fraction_non_alphanumeric': 0.026143790849673203, 'fraction_numerical': 0.017973856209150325, 'mean_word_length': 4.951456310679611, '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 optimal molecular trees with respect to Sombor indices

The Sombor index and reduced Sombor index, introduced by mathematical chemist Ivan Gutman [MATCH Commun. Math. Comput. Chem. 86 (2021) 11–16], are the recently proposed degree-based graph invariants that attained a lot of attention from researchers in a very short time. In this paper, the best possible upper bounds on the both aforementioned indices for molecular trees are obtained in terms of order and number of branching vertices or vertices of degree 2. The optimal molecular trees achieving the obtained bounds are also completely characterized.