An L(2,1) labeling (or) distance two labeling of a graph G is a function f from the vertex set V(G) to the set of all non-negative integers such that |f(x) −f(y)|≥ 2 if d(x,y) =1 and |f(x) −f(y)|≥ 1 if d(x, y) = 2. The L(2, 1) labeling number (G) of G is the smallest number k such that G has an L(2,1) labeling with max{f(v), v∈ V(G)} = k. In this paper we determine the L(2,1) labeling number (G) for the line graph of triangular snake graph and spiked snake graph.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.