CFP last date
20 January 2025
Reseach Article

Article:Edge-Odd Gracefulness of PM SN, for M = 5, 6, 7, 8

by A.Solairaju, C. Vimala, A. Sasikala
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 9 - Number 11
Year of Publication: 2010
Authors: A.Solairaju, C. Vimala, A. Sasikala
10.5120/1524-1682

A.Solairaju, C. Vimala, A. Sasikala . Article:Edge-Odd Gracefulness of PM SN, for M = 5, 6, 7, 8. International Journal of Computer Applications. 9, 11 ( November 2010), 1-2. DOI=10.5120/1524-1682

@article{ 10.5120/1524-1682,
author = { A.Solairaju, C. Vimala, A. Sasikala },
title = { Article:Edge-Odd Gracefulness of PM SN, for M = 5, 6, 7, 8 },
journal = { International Journal of Computer Applications },
issue_date = { November 2010 },
volume = { 9 },
number = { 11 },
month = { November },
year = { 2010 },
issn = { 0975-8887 },
pages = { 1-2 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume9/number11/1524-1682/ },
doi = { 10.5120/1524-1682 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:58:17.436481+05:30
%A A.Solairaju
%A C. Vimala
%A A. Sasikala
%T Article:Edge-Odd Gracefulness of PM SN, for M = 5, 6, 7, 8
%J International Journal of Computer Applications
%@ 0975-8887
%V 9
%N 11
%P 1-2
%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) º f(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 Pm Θ Sm m = 5, 6, 7, 8 is obtained.

References
  1. A.Solairaju, A.Sasikala, C.Vimala, Gracefulness of a spanning tree of the graph of product of Pm and Cn, The Global Journal of Pure and Applied Mathematics of Mathematical Sciences, Vol. 1, No-2 (July-Dec 2008): pp 133-136
  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, C.Vimala, A.Sasikala, Gracefulness of a spanning tree of the graph of Cartesian product of Sm and Sn, The Global Journal of Pure and Applied Mathematics of Mathematical Sciences, Vol. 1, No-2 (July-Dec 2008): pp 117-120
  4. 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
  5. A.Solairaju, C. Vimala, A. Sasikala, Edge-Odd Gracefulness of C3  Pn and C3 2Pn for n is even (communicated to Serial Publications)
Index Terms

Computer Science
Information Sciences

Keywords

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