Distance Two labeling for Multi-Storey Graphs
Jayapal Baskar Babujee, S. Babitha · International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks · 2010
An L (2, 1)-labeling of a graph G (also called distance two labeling) is a function f from the vertex set V (G) to the non negative integers {0,1,…,or span of G is the smallest k such that there is a f with max {f (v) : vє V(G)}= k.In this paper we introduce a new type of graph called multi-storey graph.The distance two labeling of multi-storey of path, cycle, Star graph, Grid, Planar graph with maximal edges and its span value is determined.Further maximum upper bound span value for Multi-storey of simple graph are discussed.