{'fraction_non_alphanumeric': 0.0319634703196347, 'fraction_numerical': 0.0, 'mean_word_length': 4.556962025316456, '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 Extended Adjacency Index with respect to Acyclic, Unicyclic and Bicyclic Graphs

For a (molecular) graph G, the extended adjacency index E A ( G ) is defined as equation . In this paper we introduce some graph transformations which increase or decrease the extended adjacency ( E A ) index. Also, we obtain the extremal acyclic, unicyclic and bicyclic graphs with minimum and maximum of the E A index by a unified method, respectively.