Radio analytic mean labeling of some graphs

A Radio Analytic mean Labeling of an associated diagram G is a balanced guide V from the vertex set v(G) to the arrangement of z^+ with the end goal that for any two distinct vertices x and y of G. d ( x , y ) + ⌈ | ( f ( u ) ) − ( f ( v ) ) | 2 ⌉ ≥ 1 + diam G . The Radio Analytic mean number of n, RAMN (n) is the greatest number relegated to any vertex of G. The Radio Analytic mean number of G, is the least value of RAMN(n) taken over all Radio Analytic mean labeling n of G. In this paper we locate the radio Analytic mean number of splitting of Bistar graph, standing graph, wheel graph.