On L(d,1)-labelling of Trees

Given a graph G and a positive integer d, an L(d,1)-labelling of G is a function f that assigns to each vertex of G a non-negative integer such that if two vertices u and v are adjacent, then |f(u)-f(v)|>= d and if u and v are at distance two, then |f(u)-f(v)|>= 1. The L(d,1)-number of G, λd(G), is the minimum m such that there is an L(d,1)-labelling of G with f(V)⊆ {0,1,… ,m}. A tree T is of type 1 if λd(T)= Δ +d-1 and is of type 2 if λd(T)>= Δ+d. This paper provides sufficient conditions for λd(T)=Δ+d-1 generalizing the results of Wang [11] and Zhai, Lu, and Shu [12] for L(2,1)-labelling.