{'fraction_non_alphanumeric': 0.02556818181818182, 'fraction_numerical': 0.028409090909090908, 'mean_word_length': 3.7066666666666666, '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}}
The Laplacian spectrum of corona of two graphs

Let G1,G2 be two connected graphs. Denote the corona and the edge corona of G1, G2 by G1 o G2 and G = G1 ◊ G2, respectively. In this paper, we compute the Laplacian spectrum of the corona G o H of two arbitrary graphs G and H and the edge corona of a connected regular graph G1 and an arbitrary graph G2.