International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 105 - Number 1 |
Year of Publication: 2014 |
Authors: A.solairaju, D. Senthil Kumar |
10.5120/18344-9460 |
A.solairaju, D. Senthil Kumar . Edge-Odd Graceful Graphs Related to Ladder and Complete Graph with Four Vertices. International Journal of Computer Applications. 105, 1 ( November 2014), 33-35. DOI=10.5120/18344-9460
A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f : E(G) ? {1, 3, 5,…,2q-1} so that induced map f+:V(G) ? [0, 1, 2, 3, …, (2k-1)] defined by f+(x) = ?f (xy) (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 ( P2 ? Pn) ? Pn [n copies of doors]