International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 81 - Issue 12 |
Published: November 2013 |
Authors: S. Uma Maheswari |
![]() |
S. Uma Maheswari . Edge Odd Graceful Labeling for Different Paths using Padavon Sequence. International Journal of Computer Applications. 81, 12 (November 2013), 19-23. DOI=10.5120/14064-2268
@article{ 10.5120/14064-2268, author = { S. Uma Maheswari }, title = { Edge Odd Graceful Labeling for Different Paths using Padavon Sequence }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 81 }, number = { 12 }, pages = { 19-23 }, doi = { 10.5120/14064-2268 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A S. Uma Maheswari %T Edge Odd Graceful Labeling for Different Paths using Padavon Sequence%T %J International Journal of Computer Applications %V 81 %N 12 %P 19-23 %R 10.5120/14064-2268 %I Foundation of Computer Science (FCS), NY, USA
The even graceful labeling of a graph G with q edges means that there is an injection f : V(G) to { 0,1,1,1,2,…,2q+i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {1,3,5,…,2q-1}. A graph which admits an edge odd graceful labeling is called an edge-odd graceful graph. In this paper, the edge odd gracefulness of paths p1, p2, p3,…, p12 ¬is obtained.