Even Edge - Graceful Labeling of Tt,n,m

An even- edge - graceful labeling of a (p, q) - graph G (V, E) is an injection f from E to {1, 2, 3,. . . , 2q} such that the induced mapping defined on V by = over all edges xy are distinct and even, where k=max{p, q}. A graph G that admits an even- edge graceful labeling is called an even edge - graceful graph. Tt, n, m is a graph obtained by joining the centers of K1, n and K1, m by a path Pt. . In this paper, we obtain even - edge - graceful labeling of Tt, n, m. Subject classification 05C78