Volume :3 , Issue :1 ,Page :42-66

Abstract :Let G be a (p, q) - graph. A bijective function f : V(G) ∪ 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 ad mits a super graceful labeling. In this paper, we show that the graphs H graph, H ☉ mK 1 and H ) n (  are super graceful graphs.