= 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.]]>
= 1 labels. The (modified) Zagreb index of a graph is defined as the sum of the squares of the outdegrees of all vertices in the graph. We give the mean and variance of this index in random bucket recursive trees. Also, two limiting results on this index are given.]]>
0.4, the models behave differently rather than data for both data sets.
]]>