Radio Labeling For Some Cycle Related Graphs
Samir K. VAIDYA, P L Vihol · International Journal of Mathematics and Soft Computing · 2012
Let G = (V (G), E(G)) be a connected graph and let d(u, v) denote the distance between any two vertices in G. The maximum distance between any pair of vertices is called the diameter of G denoted by diam(G). A radio labeling ( or multilevel distance labeling) forG is an injective function f: V (G) − → N ∪{0} such that for any vertices u and v, |f(u) − f(v) | ≥ diam(G) − d(u, v)+1. The span of f is the largest number in f(V). The radio number of G, denoted by rn(G) is the minimum span of a radio labeling of G. In this paper we determine upper bounds of radio numbers for cycle with chords and n/2-petal graph. Further the radio number is completely determined for the split graph and middle graph of cycle Cn.