|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 9 - Issue 12 |
| Published: November 2010 |
| Authors: A.Solairaju, C. Vimala, A. Sasikala |
10.5120/1525-1683
|
A.Solairaju, C. Vimala, A. Sasikala . Article:Edge-Odd Gracefulness of the Graph S2?Sn. International Journal of Computer Applications. 9, 12 (November 2010), 1-3. DOI=10.5120/1525-1683
@article{ 10.5120/1525-1683,
author = { A.Solairaju,C. Vimala,A. Sasikala },
title = { Article:Edge-Odd Gracefulness of the Graph S2?Sn },
journal = { International Journal of Computer Applications },
year = { 2010 },
volume = { 9 },
number = { 12 },
pages = { 1-3 },
doi = { 10.5120/1525-1683 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2010
%A A.Solairaju
%A C. Vimala
%A A. Sasikala
%T Article:Edge-Odd Gracefulness of the Graph S2?Sn%T
%J International Journal of Computer Applications
%V 9
%N 12
%P 1-3
%R 10.5120/1525-1683
%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, …, 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, …, (2k-1)}defined by f+(x) º Sf(x, y) (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 S2□Sn is obtained.