We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

Article:Edge-Odd Gracefulness of the Graph S2?Sn

by A.Solairaju, C. Vimala, A. Sasikala
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

@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 },
issue_date = { November 2010 },
volume = { 9 },
number = { 12 },
month = { November },
year = { 2010 },
issn = { 0975-8887 },
pages = { 1-3 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume9/number12/1525-1683/ },
doi = { 10.5120/1525-1683 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:58:22.740944+05:30
%A A.Solairaju
%A C. Vimala
%A A. Sasikala
%T Article:Edge-Odd Gracefulness of the Graph S2?Sn
%J International Journal of Computer Applications
%@ 0975-8887
%V 9
%N 12
%P 1-3
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
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
  1. 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
  2. A.Solairaju and K.Chitra, Edge-odd graceful labeling of some graphs, ‘Electronics Notes in Discrete Mathematics’ Volume 33, April 2009, Pages 15 - 20
  3. 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
  4. A.Solairaju, C. Vimala, and A.Sasikala, ‘Edge-odd Gracefulness of C3 Q Pn &C3 Q 2Pn’ (communicated to Serial Publications )
Index Terms

Computer Science
Information Sciences

Keywords

Graceful Graph Edge-odd graceful labeling Edge-odd graceful graph