Radio Labeling of Different Graphs

Abstract

This thesis is about Radio Labeling. For a graph G, any two vertices, v1 and v2 in G, Let d(v1, v2) represent the distance between v1 and v2. Let diameter of G is diam(G). A Multi-level distance labeling(radio labeling) for G is a function f that assign to each vertex so that they can satisfy this condition d(v1, v2) + |f(v1) − f(v2)| ≥ diam(G) + 1 The main purpose for this research is to find the radio number of Web graph rn(Wn), embedded graph rn(Emn) and radio number of double wheel graph rn(DWn). we use basic concept to find their radio numbers.