A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

Graceful and odd graceful labeling of some graphs Page 1 International Journal of Mathematics
and Soft Computing Vol.3, No.1 (2013), 61 - 68. ISSN Print : 2249 - 3328 ISSN Online: 2319 …

Some new families of Graceful Graphs Page 1 Some new families of Graceful Graphs Samina
Abbas Boxwala1 Department of Mathematics,Nowrosjee Wadia College of Arts and Science …

Some new graceful graphs Page 1 International Journal of Mathematics and Soft
Computing Vol.1, No.1 (2011), 37 - 45 ISSN 2249 - 3328 Some new graceful graphs 1 SKVaidya …

Let T be a tree on m edges. If its vertices can be distinctly labeled using integers 0, 1,···, m so
that the induced edge labels (vertices labeled i and j induces label| i− j| on edge (i, j)) are …

Graph labeling was first introduced in 1960 s. At present various graph labeling techniques
are available and more than 800 research papers have been published so far. The interest …