An L(d,j,s) labeling of graph G is a function f from the vertex set of a graph to the set of positive integers, where |f(x)-f(y)| ?? d if D(x,y)=1, |f(x)-f(y)|?? j if D(x,y)=2, and |f(x)-f(y)|?? s if D(x,y)=3 for positive integers m and d where d>j>s.