RADIO LABELINGS FOR CORONA PRODUCT OF P_2 bigodot W_n, n geq 6
Saima Nazeer, Imrana Kousar · International Journal of Pure and Apllied Mathematics · 2014
For a connected graph G, let d(x, y) denotes the distance between two distinct vertices x, y in G and diam(G) be the diameter of G.A radio labeling (or multi-level distance labeling) of a graph G is a function f that assigns positive integers to the vertices of G satisfying |f (x)-f (y)| ≥ diam(G)+ 1d(x, y).The largest integer in the range of the labeling is its span.The radio number is the minimum possible span taken over all radio labelings of G, denoted by rn(G).In this paper we show that rn(P 2 W n ) = 2n + 5, n ≥ 6.