{'fraction_non_alphanumeric': 0.00821917808219178, 'fraction_numerical': 0.0, 'mean_word_length': 4.71875, '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}}
Characterization of some extremal graphs with diameter no greater than three

We consider the problem to find the lower bound for the number of edges for graphs in which after removing an arbitrary vertex or an arbitrary edge the diameter of the graph obtained does not exceed three. Also, the graphs for which the lower bound determined is attained are enumerated.