%0 Journal Article
%T DISTANCE TWO LABELING FOR MULTI-STOREY GRAPHS
%A J.Baskar Babujee
%A S.Babitha
%J International Journal on Applications of Graph Theory in Wireless ad hoc Networks and Sensor Networks
%D 2010
%I Academy & Industry Research Collaboration Center (AIRCC)
%X An L (2, 1)-labeling of a graph G (also called distance two labeling) is a function f from the vertexset V (G) to the non negative integers {0,1,бн, k }such that |f(x)-f(y)| 2 if d(x, y) =1 and | f(x)- f(y)| 1 ifd(x, y) =2. The L (2, 1)-labeling number (G) or span of G is the smallest k such that there is a f withmax {f (v) : v V(G)}= k. In this paper we introduce a new type of graph called multi-storey graph. Thedistance two labeling of multi-storey of path, cycle, Star graph, Grid, Planar graph with maximal edgesand its span value is determined. Further maximum upper bound span value for Multi-storey of simplegraph are discussed.AMS Subject Classification: 05C78
%K Labeling
%K Cycle
%K Complete
%K Grid
%K Planar
%U http://airccse.org/journal/graphhoc/papers/0910jgraph3.pdf