CHANNEL ASSIGNMENT OF TRIANGULAR GRID AND LADDER RELATED GRAPHS USING RADIO LABELING

Let G(V, E) be a graph with vertex set V and edge set E. Let u, v be any two distinct vertices of graph G. A radio labeling of a graph G is a function f : V(G) -> N (set of natural numbers) such that, d(u, v) + vertical bar f(u)-f(v)vertical bar >= diam(G)+1, where d(u, v) represents the shortest distance between the vertices u and v and diam(G) represents the diameter of the graph G. The span of a radio labeling f is max {vertical bar f(u) - f(v)vertical bar : u, v is an element of V(G)}. The radio number of G is the minimum span of all radio labeling of G and is denoted by rn(G). In this paper, the bounds of radio number of certain types of graphs have been determined.