RADIO MEAN LABELING OF DOUBLE TRIANGULAR SNAKE GRAPH AND QUADRILATERAL SNAKE GRAPH

A Radio Mean labeling of a connected graph G is a one to one map h from the vertex set V(G) to the set of natural  numbers N such that for any two distinct vertices x and y of G,  d(x, y)  +   ³  1 + diam(G). The radio mean number of h, rmn(h), is the maximum number assigned to any vertex of G. The radio mean number of G, rmn(G), is the minimum value of rmn(h) taken over all radio mean labelings h of G. In this paper we find the radio mean number of double triangular snake graph and double quadrilateral snake graph.