CFP last date
20 May 2024
Reseach Article

Article:Edge-odd Gracefulness of Product of P2 and CN

by A.Solairaju, C. Vimala ands A.Sasikala
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 10 - Number 10
Year of Publication: 2010
Authors: A.Solairaju, C. Vimala ands A.Sasikala
10.5120/1523-1680

A.Solairaju, C. Vimala ands A.Sasikala . Article:Edge-odd Gracefulness of Product of P2 and CN. International Journal of Computer Applications. 10, 10 ( November 2010), 1-3. DOI=10.5120/1523-1680

@article{ 10.5120/1523-1680,
author = { A.Solairaju, C. Vimala ands A.Sasikala },
title = { Article:Edge-odd Gracefulness of Product of P2 and CN },
journal = { International Journal of Computer Applications },
issue_date = { November 2010 },
volume = { 10 },
number = { 10 },
month = { November },
year = { 2010 },
issn = { 0975-8887 },
pages = { 1-3 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume10/number10/1523-1680/ },
doi = { 10.5120/1523-1680 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:59:20.774556+05:30
%A A.Solairaju
%A C. Vimala ands A.Sasikala
%T Article:Edge-odd Gracefulness of Product of P2 and CN
%J International Journal of Computer Applications
%@ 0975-8887
%V 10
%N 10
%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)  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 strong product of P2 and Cn 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, A.Sasikala, C.Vimala, edge-odd gracefulness of the square 2-nC4, 3-nC4, 4-nC4, (communicated to Serial Publications, New Dehli)
Index Terms

Computer Science
Information Sciences

Keywords

Graceful Graphs Edge-odd graceful labeling Edge-odd Graceful Graph