Radio Analytic Mean labeling on Degree splitting of some graphs

Abstract

A Radio Analytic  Mean labeling  of a connected graph G is a one to one map f from the vertex v(G) to set  N  such that for any two distinct vertices of  u and v of G.  +   1+ diam (G).A graph which admits  radio analytic mean labeling is called radio analytic mean graph. The  Radio Analytic  mean number n, is the maximum   number assigned  to any vertex of G.The  Radio mean number of G ,ram(G) is the minimum  value of  taken  all  over Radio Analytic  mean labeling  of  G. In this paper we discuses Radio   Analytic mean labeling on  degree splitting of some  graphs