Graceful Labeling for Disconnected Grid Related Graphs
V. J. Kaneria, H. M. Makadia, R. V. Viradia · Bulletin of Mathematical Sciences and Applications · 2015
In this paper we have proved that union of three grid graphs, U3l=1(Pnl×Pml)and union of finite copies of a grid graph (Pn×Pm)are graceful. We have also given two graceful labeling functions to the grid graph (Pn×Pm).