# Radio Analytic Antipodal Mean Number of some graphs

## Main Article Content

## Abstract

Let G(V,E) be a graph with p vertices and q edges with vertex set V and edge set E. let ‘d’ denote the diameter of G and d(u,v) denote the distance between the vertices u and v in G.

P.Poomalai et al was introduced the concept of radio analytic mean labeling in 2019.And he also indicated one more concept radio analytic mean D-distance number 2020. here we introduce a new labeling graph called Radio Antipodal Analytic mean labeling. An Radio Antipodal Analytic mean labelling of G is a function f that assigns to each vertex a non-negative integer such that f(u) ≠ f(v) if d(u,v) + ⌠f(u)^{2} – f(v)^{2} ⌠/2 ≥ d for any two distinct vertices u, v € V(G). The Antipodal Analytic mean number of f denoted by a_{amn}(f) is the maximum number assigned to any vertex of G. The Radio Antipodal Analytic mean number of G, denoted by A_{amn}(G) is the maximum value of A_{amn}(f) taken over all Radio Antipodal mean labelling f of G. We prove P_{n}, Cycle Cn, Star K_{1,n},Ladder L_{n}, n-bistar B_{n,n} and fan f_{2n+1} are the Radio Antipodal Analytic mean graphs.