{'fraction_non_alphanumeric': 0.02286902286902287, 'fraction_numerical': 0.0, 'mean_word_length': 5.259740259740259, '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}}
On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs

The aim of this paper is to generalize some concepts and recent results of the algebraic graph theory in order to investigate and describe, by algebraic methods, the properties of some combinatorial structures. Here we introduce a version of "Laplacian matrix" of a hypergraph and we obtain several spectral-like results on its metric parameters, such as the diameter, mean distance, excess, bandwidth and cutsets.