No-holeλ-L(k,k−1,...,2,1)-labeling for Square Grid11If the distance between two vertices is at leastk+1, the same label can be used forboth of them. This ...

Sep 21, 2016 · In this paper a lower bound on the value of the labeling number for square grid is computed and a formula is proposed which yields a \lambda-L(k ...

ATTA, Soumen, GOLDSTEIN, Stanisław and SINHA MAHAPATRA, Priya Ranjan, 2017, No-hole λ-L (k, k – 1, …, 2,1)-labeling for square grid.

A $\lambda$-$L(k, k-1, \ldots, 2, 1)$-labeling of a graph $G$ is said to be a no-hole labeling if all the labels between $0$ and $\lambda-1$ are used at least ...

No-hole λ-L(k,k−1,...,2,1)-labeling for Square Grid. 11. If the distance between two vertices is at least k + 1, the same label can be used for both of them ...

In this paper a lower bound on the value of the labeling number for square grid is computed and a formula is proposed which yields a $\lambda$-$L(k, k-1, \ldots ...

Given a fixed $k$ $\in$ $\mathbb{Z}^+$ and $\lambda$ $\in$ $\mathbb{Z}^+$, the objective of a $\lambda$-$L(k, k-1, \ldots, 2, 1)$-labeling of a graph $G$ is ...

The L(2, 1)-labeling problem of graphs has been discussed for many graph families, see [2–4,7,9,10]. Similarly, we define the anti-Ld(2, 1)-labeling problem: ...

An L(2,1)-coloring of a graph G is a coloring of G's vertices with integers in {0,1,…,k} so that adjacent vertices' colors differ by at least two and colors ...

ATTA, Soumen, GOLDSTEIN, Stanisław and SINHA MAHAPATRA, Priya Ranjan, 2017, No-hole λ-L (k, k – 1, …, 2,1)-labeling for square grid.