An L(2,1)-labeling of a graph G is a function f:V(G)→{0,1,…,k} such that |f(x)−f(y)|≥2 if x and y are adjacent vertices, and |f(x)−f(y)|≥1 if x and y are at distance 2. Such labelings were introduced ...

Article