Super Graceful Labeling for Some Families of Fan Graphs

S. Amutha* and M. Uma Devi1

Assistant Professors, Department of Mathematics, Government Arts & Science College, Sivakasi – 626 124, INDIA.


Let G be a (p, q) graph. A bijective function f :V(G)UE(G)-->{1, 2, 3,..., p = q} such that f(uv) = f(u) - f(v) for every edge uv e 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 study the super gracefulness of Fan graph Fn , Double Fan graph DFn and SF(m, n).

Keywords :Graceful labeling, Super graceful labeling, Fan graph.

map1 map2 map3