{'fraction_non_alphanumeric': 0.01348314606741573, 'fraction_numerical': 0.0, 'mean_word_length': 4.868421052631579, '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 Note on Counting Connected Graph Covering Projections

During the last decade, a lot of progress has been made in the enumerative branch of topological graph theory. Enumeration formulas were developed for a large class of graph covering projections. The purpose of this paper is to count graph covering projections of graphs such that the corresponding covering space is a connected graph. The main tool of the enumeration is Polya's theorem.