A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Pair L(2,1)-labelings of infinite graphs
2018
Discussiones Mathematicae Graph Theory
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.
doi:10.7151/dmgt.2077
fatcat:276vc6c7fzevleoq5z4r7po2su