International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 10 - Number 9 |
Year of Publication: 2010 |
Authors: A.Solairaju, C. Vimala ands A.Sasikala |
10.5120/1514-1681 |
A.Solairaju, C. Vimala ands A.Sasikala . Article:Edge-Odd Gracefulness of C3 PN and C3 2PN. International Journal of Computer Applications. 10, 9 ( November 2010), 1-3. DOI=10.5120/1514-1681
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) (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 C3 Pn and C3 2Pn is obtained.