Subscribe

Subscribe to our Newsletter and get informed about new publication regulary and special discounts for subscribers!

BMSA > Volume 11 > Graceful Labeling for Disconnected Grid Related...
< Back to Volume

Graceful Labeling for Disconnected Grid Related Graphs

Download PDF

Abstract:

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).

Info:

Periodical:
Bulletin of Mathematical Sciences and Applications (Volume 11)
Pages:
6-11
DOI:
10.18052/www.scipress.com/BMSA.11.6
Citation:
V.J. Kaneria et al., "Graceful Labeling for Disconnected Grid Related Graphs", Bulletin of Mathematical Sciences and Applications, Vol. 11, pp. 6-11, 2015
Online since:
Feb 2015
Export:
Distribution: