Let G = (V; E) be a connected graph. For integers j ? k, L( j; k)-labeling of a graph G is an integer labeling of the vertices in V such that adjacent vertices receive integers which differ by at least j and vertices which are at distance two apart receive labels which differ by at least k. In this paper we discuss L(2; 1) labeling (or distance two labeling) in the context of some graph operations.