International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 105 - Issue 1 |
Published: November 2014 |
Authors: A.Solairaju, D. Senthil Kumar |
![]() |
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
@article{ 10.5120/18344-9460, author = { A.Solairaju,D. Senthil Kumar }, title = { Edge-Odd Graceful Graphs Related to Ladder and Complete Graph with Four Vertices }, journal = { International Journal of Computer Applications }, year = { 2014 }, volume = { 105 }, number = { 1 }, pages = { 33-35 }, doi = { 10.5120/18344-9460 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2014 %A A.Solairaju %A D. Senthil Kumar %T Edge-Odd Graceful Graphs Related to Ladder and Complete Graph with Four Vertices%T %J International Journal of Computer Applications %V 105 %N 1 %P 33-35 %R 10.5120/18344-9460 %I Foundation of Computer Science (FCS), NY, USA
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]