An L(2, 1)−labeling (L21L) of a graph G = (V, E) is an assignment f from the node-set V to the set {0, 1, 2, 3, . . .} so that adjoining nodes get numbers at least two apart, and nodes at distance two get different numbers. ...