Graph L(2, 1)-Labeling is a type of vertex labeling in graph theory where adjacent vertices are assigned labels differing by at least two and vertices at distance two receive labels differing by at least one.