Suppose that [n] = {0, 1, 2, ..., n} is a set of non-negative integers and h, k ∈ [n]. The L(h, k)-labeling of graph G is the function l : V (G) → [n] such that |l(u) − l(v)| ≥ h if the distance d(u, v) between u and v is 1 and |l(u) − l(v)| ≥ k if d(u, v) = 2. Let L(V (G)) = {l(v) : v ∈ V (G)} and let p be the maximum value of L(V (G)). Then p is called λ k h −number of G if p is the least possible member of [n] such that G maintains an L(h, k)−labeling. In this paper, we establish λ 1 1 − numbers of P m × P n and P m × C n graphs for all m, n ≥ 2.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.