{'fraction_non_alphanumeric': 0.009416195856873822, 'fraction_numerical': 0.0, 'mean_word_length': 4.782608695652174, '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}}
Construction of some betweenness uniform graphs

The betweenness centrality of a graph measures the tendency of a single vertex to be more central than all other vertices in the graph. It is based on differences between the centrality of the most central vertex and that of all others. In many real world situations it has quite a significant role. In this paper, we initiate the study of betweenness uniform centrality of some graphs and investigate how to construct a betweenness uniform graph for a given betweenness centrality.