GRACEFUL LABELING FOR DISCONNECTED GRID RELATED GRAPHS

Abstract

In this paper we have proved that union of three grid graphs, and union of finite copies of a grid graph are graceful. We have also given two graceful labeling functions to the grid graph .