The week's pick
Reseach Article
Edge Odd Graceful Labeling for Different Paths using Padavon Sequence
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 81 - Number 12 |
| Year of Publication: 2013 |
| Authors: S. Uma Maheswari |
10.5120/14064-2268
|
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
Abstract
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.
References
- R. B. Gnanajothi, Topics in Graph Theory,Ph. D. Thesis, Madurai Kamaraj University, 1991
- G. J. Gallian, A dynamic survey of graph labeling, The electronic journal of combinatorics, 16 (2009), #DS6.
- S. W. Golomb, How to number a graph in graph theory and computing, R. C. Read, ed. , Academic Press, New York (1972), 23-37.
- A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs(International Symposium, Rome), July(1966).
- S. Uma Maheswari, Graceful Labeling of the paths using padavon sequence, International Journal of Mathematical Archive-4(4), 013, 66-71.
- S. Uma Maheswari, Even Graceful Labeling of the paths using padavon sequence, International Journal of Mathematical Archive-4(10), To appear.
Index Terms
Keywords