{'fraction_non_alphanumeric': 0.02388535031847134, 'fraction_numerical': 0.009554140127388535, 'mean_word_length': 4.1138211382113825, '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}}
New Families of Odd Harmonious Graphs

In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent to 0 or 2 (mod 4), and we found a counter example for the inverse of this statement is not true. We also proved that, the graphs which are constructed by two copies of even cycle Cn sharing a common edge are odd harmonious. In addition, we obtained an odd harmonious labeling for the graphs which are constructed by two copies of cycle Cn sharing a common vertex when n is congruent to 0 (mod 4). Moreover, we show that, the Cartesian product of cycle graph Cm and path Pn for each ) 4 (mod