International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 9 - Number 12 |
Year of Publication: 2010 |
Authors: A.Solairaju, C. Vimala, A. Sasikala |
10.5120/1525-1683 |
A.Solairaju, C. Vimala, A. Sasikala . Article:Edge-Odd Gracefulness of the Graph S2?Sn. International Journal of Computer Applications. 9, 12 ( November 2010), 1-3. DOI=10.5120/1525-1683
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) º Sf(x, y) (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 S2□Sn is obtained.