Radio mean labeling of a graph

Abstract

A Radio Mean labeling of a connected graph G is a one to one map f from the vertex set V(G) to the set of natural numbers N such that for two distinct vertices u and v of G, d(u,v)+⌈f(u)+f(v)2⌉≥1+diam(G). The radio mean number of f, rmn(f), is the maximum number assigned to any vertex of G.The radio mean number of G, rmn(G) is the minimum value of rmn(f) taken over all radio mean labelings f of G. In this paper we find the radio mean number of graphs with diameter three, lotus inside a circle, Helms and Sunflower graphs.

Keywords

• Radio labeling
• Diameter
• Wheel
• Helms