# Radio Mean and Radio Antipodal Mean Labeling of Circulant Graphs G(4K + 2,{1,2})

### Synopsis

Let V be the vertex set and E be the edge set for the graph G = (V,E). Here represents the shortest distance between any pair of vertices and and denotes the diameter of. A one-to-one map f from the vertex set V(G) to t is what is known as a radio mean labeling of a connected graph G,that for two distinct vertices and of , . The Radio mean number of, denoted by is a maximum number assigned to any vertex of . The radio mean number of , denoted by is the minimum value of taken over all radio mean labeling of . The radio antipodal mean labeling of a graph is a function that assigns to each vertex , a non-negative integer such that if and . The radio antipodal mean number of, denoted by is the maximum number assigned to any vertex of . The radio antipodal mean number of, denoted by is the minimum value of taken overall antipodal mean labeling of . In this paper, the radio mean number and radio antipodal mean number of the Circulant graphs has been obtained.

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.