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

Published in:   Vol. 3 Issue 1 Date of Publication:   June 2014
Page(s):   50-53 Publisher:   Integrated Intelligent Research (IIR)
DOI:   10.20894/IJCOA. SAI : 2014SCIA316F0584

The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices and has neither a perfect matching nor almost perfect matching. In this paper we find the conditional matching preclusion number for triangular ladder, Cn with parallel chords, Trampoline Graph, diamond Snake Graph and K- Polygonal Snake Graph