• EVEN 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,2,4,…,2q+2i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {2,4,6,…,2q}. A graph which admits an even graceful labeling is called an even graceful graph. In this paper, the even gracefulness of paths p_1, p_2, p_3,…, p₁₁ ­is obtained.