An -labeling (or distance two labeling) of a graph G is a function f from the vertex set to the set of all nonnegative integers such that if and if The -labeling number of G is the smallest number k such that G has an -labeling with In this paper, we completely determine the l-number for square of some trees like paths, spiders and comb graphs.