Distance Two labeling for Multi-Storey Graphs

Abstract

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