LAUSR

For a fixed integer $$D (\ge 3)$$D(≥3) and $$\lambda $$λ$$\in $$∈$${\mathbb {Z}}^+$$Z+, a $$\lambda $$λ-L(D, 2, 1)-labeling of a graph $$G = (V, E)$$G=(V,E) is the problem of assigning non-negative integers (known as labels) from the set $$\{0, \ldots , \lambda \}$${0,…,λ} to the vertices of G such that if any two vertices in V are one, two and three distance apart from each other, then the assigned labels to these vertices must have a difference of at least D, 2 and 1, respectively. The vertices which are at least 4 distance apart can receive the same label. The minimum value among all the possible values of $$\lambda $$λ for which there exists a $$\lambda $$λ-L(D, 2, 1)-labeling is known as the labeling number. In this paper, $$\lambda $$λ-L(D, 2, 1)-labeling of square grid is considered. The lower bound on the labeling number for square grid is presented, and a formula for $$\lambda $$λ-L(D, 2, 1)-labeling of square grid is proposed. The correctness proof of the proposed formula is given here. The upper bound of the labeling number obtained from the proposed labeling formula for square grid matches exactly with the lower bound of the labeling number.