Pair L(2,1)-labelings of infinite graphs
Roger K. Yeh · Discussiones Mathematicae Graph Theory · 2018
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.