DOI:10.20894/IJCOA.
Periodicity: Bi Annual.
Impact Factor:
SJIF:5.079 & GIF:0.416
Submission:Any Time
Publisher: IIR Groups
Language: English
Review Process:
Double Blinded

News and Updates

Author can submit their paper through online submission. Click here

Paper Submission -> Blind Peer Review Process -> Acceptance -> Publication.

On an average time is 3 to 5 days from submission to first decision of manuscripts.

Double blind review and Plagiarism report ensure the originality

IJCOA provides online manuscript tracking system.

Every issue of Journal of IJCOA is available online from volume 1 issue 1 to the latest published issue with month and year.

Paper Submission:
Any Time
Review process:
One to Two week
Journal Publication:
June / December

IJCOA special issue invites the papers from the NATIONAL CONFERENCE, INTERNATIONAL CONFERENCE, SEMINAR conducted by colleges, university, etc. The Group of paper will accept with some concession and will publish in IJCOA website. For complete procedure, contact us at admin@iirgroups.org

Paper Template
Copyright Form
Subscription Form
web counter
web counter
Published in:   Vol. 2 Issue 1 Date of Publication:   June 2013

Graceful Labeling of Bow Graphs and Shell-Flower Graphs

J. Jeba Jesintha,Ezhilarasi Hilda Stanley

Page(s):   62-64 ISSN:   2278-2397
DOI:   10.20894/IJCOA.101.002.001.017 Publisher:   Integrated Intelligent Research (IIR)

A graceful labeling of a graph G with q edges and vertex set V is an injection f: V(G) → {0,1,2,.q} with the property that the resulting edge labels are also distinct, where an edge incident with vertices u and v is assigned the label |f(u) f(v)| . A graph which admits a graceful labeling is called a graceful graph. A Shell graph is defined as a cycle Cnwith (n -3) chords sharing a common end point called the apex . Shell graphs are denoted as C(n, n- 3). A multiple shell is defined to be a collection of edge disjoint shells that have their apex in common. Hence a double shell consists of two edge disjoint shells with a common apex. A bow graph is defined to be a double shell in which each shell has any order. In this paper we prove that the bow graph with shell orders m and 2m is graceful. Further in this paper we define a shell flower graph as k copies of [C(n, n-3) U K2] and we prove that all shell - flower graphs are graceful for n = 4.