SUPER GRACEFUL LABELING FOR SOME SPECIAL GRAPHS
M. A. Perumal, Shenbaga Vinayaga Moorthi Navaneethakrishnan, A. Nagarajan · 2011
Let G be a (p,q) graph. A bijective function f:V(G) U E(G) →{1,2,...,p+q} such that f(uv)= |f(u)-f(v)| for every edge uv єE(G) is said to be a super graceful labeling. A graph G is called a super graceful graph if it admits a super graceful labeling. In this paper, we show that the graphs Pn-1 (1,2,...,n), Coconut tree, Km,n, Sm,n and B(m,n,k) are super graceful graphs.