{'fraction_non_alphanumeric': 0.016568047337278107, 'fraction_numerical': 0.0, 'mean_word_length': 5.409090909090909, '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 Coding Algorithm using Super-edge Magic Total Labeling of Extended Duplicate Graphs

Graph labeling has wide applications in the field of radio astronomy, computer networks, communication networks and cryptography etc. Encoding is a technique of sending messages as codes over a communication channel decoding is a method of interpreting the received codes into messages again so that only sender and receiver understands the message and others could not. Graph labeling is an assignment of labels (numbers) to vertices or edges or both subject to certain criteria. In this paper, encoding and decoding algorithms sandwiching super-edge magic total labeling algorithms, super-edge antimagic total labeling and algorithms like affine-cipher and RSA algorithms are presented to encode messages and decode codes and illustrate them with examples.