{'fraction_non_alphanumeric': 0.04129793510324484, 'fraction_numerical': 0.0, 'mean_word_length': 3.2974683544303796, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Radio Antipodal Number of Circulant Graphs

Let G = V, E be a graph with vertex set V and edge set E. Let diam G denote the diameter of G and d u, v denote the distance between the vertices u and v in G. An antipodal labeling of G with diameter d is a function f that assigns to each vertex u, a positive integer f u , such that d u, v + f u − f v ≥ d, for all u, v ∈ V. The span of an antipodal labeling f is max f u − f v : u, v ∈ V(G). The antipodal number for G, denoted by anG, is the minimum span of all antipodal labelings of G. Determining the antipodal number of a graph G is an NP-complete problem. In this paper we determine the antipodal number of circulant graphs .