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

Paper Template
Copyright Form
Subscription Form
web counter
web counter
Published in:   Vol. 3 Issue 3 Date of Publication:   December 2014

Chordal Graphs and Their Clique Graphs

J.Arockia Aruldoss,P.Kalaivani

Page(s):   236-239 ISSN:   2278-2397
DOI:   10.20894/IJCOA. Publisher:   Integrated Intelligent Research (IIR)

In this paper, we present a new structure for chordal graph. We have also given the algorithm for MCS(Maximal Cardinality Search) and lexicographic BFS(Breadth First Search) which is used in two linear time and space algorithm. Also we discuss how to build a clique tree of a chordal graph and the other is simple recognition procedure of chordal graphs.Chordal graphs have been considered as the intersection graphs of subtrees of a tree. Chordal graphs are often represented by a clique tree. The structure of clique tree does not only appeared in the graph theory literature, but in context of ascyclic database schemes and in the context of spare matrix computations too.Chordal graphs can also be characterized using Perfect Elimination Orderings (PEO). A vertex is simplicial if and only if its neighbourhood is a complete subgraph. An elimination ordering x , x ,...xn 1 2 is perfect if and only if each xi is simplicial in the subgraph indued by i n x ,......x A new structure namely the clique graph is introduced .In this paper some graph properties of this structure are studied with regard to clique trees. And the clique graph is justified as being the optimal structure containing all clique trees of a chordal graph.