Pair L(2, 1)-Labelings of Infinite Graphs

Abstract

An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This article studies a generalization of the L(2, 1)-labeling. We assign sets with at least one element to vertices of G under some conditions.

Keywords

• l(2
• 1)-labeling
• 05c15
• 05c78
• 05c63