Latest News

Visitor Counter
336304502

EDGE- ODD Gracefulness of the Tripartite Grap...

You Are Here :
> > > >
EDGE- ODD Gracefulness of the Tripartite Grap...

EDGE- ODD Gracefulness of the Tripartite Graph

Author Name : C. Vimala, A. Sasikala, K. Ruba

ABSTRACT   A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, …, 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, …, (2k-1)} defined by     f ( x ) { f ( x , y ) / xy E } (mod 2k),where the vertex x is incident with other vertex y and k = max {p,q} makes all the edges distinct and odd. In this article, the Edge odd gracefulness of the tripartite graph K 2 , 2 , n , K 2 , 3 , n , K 2 , 6 , n K 2 , 4 , n for odd n and K 2 , 5 , n for even n are obtained.