Edge Odd Graceful Labeling for Different Paths using Padavon Sequence

Abstract

The even graceful labeling of a graph G with q edges means that there is an injection f : V(G) to { 0,1,1,1,2,…,2q+i/i= 1 to n} such that when each edge uv is assigned the label |f(u) -f(v)| the resulting edge labels are {1,3,5,…,2q-1}.