{'fraction_non_alphanumeric': 0.020710059171597635, 'fraction_numerical': 0.0029585798816568047, 'mean_word_length': 4.745762711864407, '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}}
Graph energy and Hadamard's inequality

We use Hadamard's determinantal inequality and its generalization to prove some upper bounds on the energy of a graph in terms of degrees, average 2-degrees and number of common neighbors of its vertices. Also, we prove an inequality relating the energy of a graph and one arbitrary subgraph of it.