The week's pick
Reseach Article
Article:Edge-Odd Gracefulness of the Graph S2?Sn
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 9 - Number 12 |
| Year of Publication: 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
Abstract
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.
References
- A.Solairaju, C.Vimala and A.Sasikala, Gracefulness of a spanning tree of the graph of Cartesian product of Sm and Sn, The Global Journal of Applied Mathematics and Mathematical Sciences, Vol. 1, No-2 (July-Dec 2008): pp 117-120
- A.Solairaju and K.Chitra, Edge-odd graceful labeling of some graphs, ‘Electronics Notes in Discrete Mathematics’ Volume 33, April 2009, Pages 15 - 20
- A.Solairaju, A.Sasikala, C.Vimala, ‘Edge-odd Gracefulness of a spanning tree of Cartesian product of P2 and Cn’, Pacific-Asian Journal of Mathematics, Vol .3, No. 1-2. Jan-Dec. 2009, pp:39-42
- A.Solairaju, C. Vimala, and A.Sasikala, ‘Edge-odd Gracefulness of C3 Q Pn &C3 Q 2Pn’ (communicated to Serial Publications )
Index Terms
Keywords