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 November 2024
Reseach Article

Article:Even Vertex Gracefulness of Fan Graph

by A. Solairaju, P. Muruganantham
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 8 - Number 8
Year of Publication: 2010
Authors: A. Solairaju, P. Muruganantham
10.5120/1232-1810

A. Solairaju, P. Muruganantham . Article:Even Vertex Gracefulness of Fan Graph. International Journal of Computer Applications. 8, 8 ( October 2010), 1-4. DOI=10.5120/1232-1810

@article{ 10.5120/1232-1810,
author = { A. Solairaju, P. Muruganantham },
title = { Article:Even Vertex Gracefulness of Fan Graph },
journal = { International Journal of Computer Applications },
issue_date = { October 2010 },
volume = { 8 },
number = { 8 },
month = { October },
year = { 2010 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume8/number8/1232-1810/ },
doi = { 10.5120/1232-1810 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:57:28.835854+05:30
%A A. Solairaju
%A P. Muruganantham
%T Article:Even Vertex Gracefulness of Fan Graph
%J International Journal of Computer Applications
%@ 0975-8887
%V 8
%N 8
%P 1-4
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A graph is even vertex gracefulif there exists an injective map f : E (G) ® {1,2,…,2q} so that the induced map f+: V(G) ® {0,2,4,…,2k-2} defined by f+ (x) = å f(xy) (mod 2k) where k= max { p, q } makes all distinct.

References
  1. A. Solairaju and K.Chitra, Edge-odd graceful labeling of some graphs, Electronics Notes in Discrete Mathematics Volume 33, April 2009, pp. 15.
  2. A. Solairaju and P.Muruganantham, even-edge gracefulness of ladder, The Global Journal of Applied Mathematics & Mathematical Sciences(GJ-AMMS). Vol.1.No.2, (July-December-2008):pp.149-153.
  3. A. Solairaju and P.Muruganantham, even vertex gracefulness of path merging circuits, Indian Journal of Mathematics and Mathematical Sciences, Vol. 6, No.1, (June, 2010), pp.27 – 31.
  4. A. Solairaju and P.Muruganantham, even vertex gracefulness of even number of copies of C4, accepted for publication in Serials Publications, New Delhi, India.
  5. A.Solairaju, and A.Sasikala, 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.
  6. A.Solairaju, and C.Vimala, 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): pp117- 120.
Index Terms

Computer Science
Information Sciences

Keywords

Vertex Fan Graph