An L (0, 1)-labeling of a graph G=(V, E) is a function f from the vertex set V (G) to the set of
non-negative integers such that/f (x)-f (y)/-0 if d (x, y)= 1 and/f (x)-f (y)/-1 if d (x, y)= 2. The L
(0, 1)-labeling number of a graph G, denoted by,,(G) is the difference between highest and
lowest labels used. Similarly, L (l, l)-labeling of a graph G=(V, E) is a function f from its vertex
set V to the set of non-negative integers such that/fx)-f (y)/21 if d (x, y)= 1 or 2. The span of an
L (1, 1)-labeling f of G is max f (v); veV). The L (1, 1)-labeling number,,(G) of G is the smallest …