CFP last date
20 November 2025
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2025

Submit your paper
Know more
The week's pick
Responsive image
A Hybrid Transformer-CNN Framework with Early and Late Fusion for Robust Skin Lesion Classification

Raihan Tanvir
Random Articles
Reseach Article

Article:Even Vertex Graceful of Path, Circuit, Star, Wheel, some Extension-friendship Graphs and Helm Graph

by A. Solairaju, P. Muruganantham
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 10 - Number 6
Year of Publication: 2010
Authors: A. Solairaju, P. Muruganantham
10.5120/1488-2005

A. Solairaju, P. Muruganantham . Article:Even Vertex Graceful of Path, Circuit, Star, Wheel, some Extension-friendship Graphs and Helm Graph. International Journal of Computer Applications. 10, 6 ( November 2010), 5-8. DOI=10.5120/1488-2005

@article{ 10.5120/1488-2005,
author = { A. Solairaju, P. Muruganantham },
title = { Article:Even Vertex Graceful of Path, Circuit, Star, Wheel, some Extension-friendship Graphs and Helm Graph },
journal = { International Journal of Computer Applications },
issue_date = { November 2010 },
volume = { 10 },
number = { 6 },
month = { November },
year = { 2010 },
issn = { 0975-8887 },
pages = { 5-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume10/number6/1488-2005/ },
doi = { 10.5120/1488-2005 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:59:01.063257+05:30
%A A. Solairaju
%A P. Muruganantham
%T Article:Even Vertex Graceful of Path, Circuit, Star, Wheel, some Extension-friendship Graphs and Helm Graph
%J International Journal of Computer Applications
%@ 0975-8887
%V 10
%N 6
%P 5-8
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Even vertex gracefulness of path, circuit, star and wheel are obtained. Also even vertex gracefulness of the connected graphs Cn Ñ F(2nC3), Cn Ñ F(3nC3) and C(4, n) are got.

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.
  7. A. Solairaju and P.Muruganantham, Even vertex gracefulness of fan graph, International Journal of Computer Applications (0975-8887) , Vol. 8, No.8, (October, 2010)..
Index Terms

Computer Science
Information Sciences

Keywords

Vertex Cn Ñ F(2nC3) Cn Ñ F(3nC3) C(4 n)

Powered by PhDFocusTM