|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 89 - Issue 10 |
| Published: March 2014 |
| Authors: S. Uma Maheswari |
10.5120/15668-4090
|
S. Uma Maheswari . Odd - Even Graceful Labeling for Different Paths using Padavon Sequence. International Journal of Computer Applications. 89, 10 (March 2014), 20-23. DOI=10.5120/15668-4090
@article{ 10.5120/15668-4090,
author = { S. Uma Maheswari },
title = { Odd - Even Graceful Labeling for Different Paths using Padavon Sequence },
journal = { International Journal of Computer Applications },
year = { 2014 },
volume = { 89 },
number = { 10 },
pages = { 20-23 },
doi = { 10.5120/15668-4090 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2014
%A S. Uma Maheswari
%T Odd - Even Graceful Labeling for Different Paths using Padavon Sequence%T
%J International Journal of Computer Applications
%V 89
%N 10
%P 20-23
%R 10.5120/15668-4090
%I Foundation of Computer Science (FCS), NY, USA
A function f is called an odd-even graceful labeling of a graph G if f: V(G) ? {0,1,2,…,q} is injective and the induced function f* : E(G) ? { { 0,2,4,…,2q+2i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {2,4,6,…,2q}. A graph which admits an odd-even graceful labeling is called an odd-even graceful graph. In this paper, the odd-even gracefulness of paths p1, p2, p3,…, p11 ¬is obtained.