{'fraction_non_alphanumeric': 0.047619047619047616, 'fraction_numerical': 0.0022675736961451248, 'mean_word_length': 5.054794520547945, '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}}
Inverse Connective Eccentricity Index and its Applications

The inverse connective eccentricity index of a connected graph G is defined as ξ−1 ce (G) =P u∈V(G)ǫG(u)dG(u) , where ǫG(u) and dG(u) are the eccentricity and degree of a vertex u in G,respectively. In this paper, we obtain an upper bounds for inverse connective eccentricity indices for various classes of graphs such as generalized hierarchical product graph and F-sum of graphs.