Distance Two Labeling on the Square of a Cycle

Abstract

Abstract. An L(2, 1)-labeling of a graph G is a function f from the vertex set V (G) to the set of all non-negative integers such thatThe λ-number of G, denoted λ(G), is the smallest number k such that G admits an L(2, 1)-labeling with k = max{f (u)|u ∈ V (G)}. In this paper, we consider the square of a cycle and provide exact value for its λ-number. In addition, we also completely determine its edge span.