{'fraction_non_alphanumeric': 0.019784172661870502, 'fraction_numerical': 0.014388489208633094, 'mean_word_length': 4.983870967741935, '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}}
Towards a characterization of graphs with distinct betweenness centralities

In a social network individuals have prominent centrality if they are intermediaries between the communication of others. The betweenness centrality of a vertex measures the number of intersecting geodesics between two other vertices. Formally, the betweenness centrality of a vertex v is the ratio of the number of shortest paths between two other vertices u and w which contain v to the total number of shortest paths between u and w. In this paper, we consider the problem of characterizing all graphs with R. LOPEZ ET AL. /AUSTRALAS. J. COMBIN. 68 (2) (2017), 285–303 286 distinct betweenness centralities. This results in a specialized class of graphs with unusual symmetries including a trivial automorphism group. We begin by solving the problem for all graphs with less than or equal to seven vertices. Then we consider the general problem by investigating the density and minimality of graphs with distinct betweeness centralities Finally, we investigate the problem of creating infinite families of graphs with this property.