L(2,1) - Labeling of Chemical Graphs

An -labeling of a graph  is a function  is a set of non- negative integers such that  if  and  if , where  is the distance between the vertices  and  in the graph . -labeling number, represented as  is the smallest number  such that the -labeling exists with a maximum label . In this manuscript,  we have determined the bounds for -labeling number of Melem structure and Cyclen-Pyrene Dendrimers.