{'fraction_non_alphanumeric': 0.018518518518518517, 'fraction_numerical': 0.0, 'mean_word_length': 4.921875, '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}}
Research problem: The completion number of a graph

Motivated by the remarkable connection between graph theory and matrix analysis, we associate to each graph a so-called completion number that might encode some aspects of this interplay. We show that this number is not trivial, and we ask for a graph-theoretic characterization of those graphs with a given completion number.