{'fraction_non_alphanumeric': 0.020905923344947737, 'fraction_numerical': 0.0, 'mean_word_length': 5.182795698924731, '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}}
A Repository of Compound Graphs for use in Large Network Design

In a field of network design, engineers desire better ways to design efficient communication network. While designing such network, we are restricted with engineering constraints such as communication delays and hardware costs. Many construction techniques have been proposed. In this paper we focus on compounding techniques and provide (∆,D) tables that contain the largest compound graphs for given degree ∆ and diameter D. We also empirically verify a few of the recently discovered large compound graphs.