Radio mean labeling of a graph
Raja Ponraj, S. Sathish Narayanan, R. Kala · AKCE International Journal of Graphs and Combinatorics · 2015
A Radio Mean labeling of a connected graph is a one to one map from the vertex set to the set of natural numbers such that for two distinct vertices and of , . The radio mean number of , , is the maximum number assigned to any vertex of .The radio mean number of , is the minimum value of taken over all radio mean labelings of . In this paper we find the radio mean number of graphs with diameter three, lotus inside a circle, Helms and Sunflower graphs.