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

Paper Template
Copyright Form
Subscription Form
web counter
web counter

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

SCIA Journal Metrics


Edge -Balance Index Sets of HELM

V.Sharon Philomena,K.Thirusangu, J.Jeba Jesintha, B.Pavithra

Published in:   Vol. 2 Issue 1 Date of Publication:   June 2013
Page(s):   65-67 Publisher:   Integrated Intelligent Research (IIR)
DOI:   10.20894/IJCOA. SAI : 2013SCIA316F0964

The edge-balance index set of a graph G (V, E) was defined by Chopra, Lee and Su[1] in 2010 as follows: For an edge labeling f:E(G)→{0,1}, a partial vertex labeling f * : V(G) → {0, 1} is defined as 0 , if more edges with label 0 are incident to v f * (v) = 1 , if more edges with label 1 are incident to v unlabeled , otherwise For i = 0 or 1, let A = {uv ∈ E : f(uv) = i} and B = {v ∈ V : f *(v) = i} Let eG (i) = |A| and vG (i) = |B|. The edge balance index set of G denoted as EBI(G) is computed as EBI(G)={|vG(0) � vG(1)|: the edge labeling f satisfies |eG(0) � eG(1)| ≤1}. The edge-balance index set for the fan graph Fn-1 where Fn-1 = Pn-1+K1 and wheel graph Wn, where Wn = Cn-1 + K1 was obtained by Lee, Tao, Lo[5]. In this paper, we compute the edge-balance index set for the Helm graph, where the Helm graph is defined as the graph obtained from a wheel graph by attaching a pendant edge at each vertex of the n- cycle.