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

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 admin@iirgroups.org

SCIA Journal Metrics


SCIA-GRAPH
SCIA-SAI

Extended Roman Domination Number of Hexagonal Networks

Chiranjilal Kujur,D.Antony Xavier, Elizabeth Thomas

Published in:   Vol. 2 Issue 2 Date of Publication:   December 2013
Page(s):   109-111 Publisher:   Integrated Intelligent Research (IIR)
DOI:   10.20894/IJCOA.101.002.002.010 SAI : 2013SCIA316F0984

An extended Roman domination function on a graph G=(V,E) is a function satisfying the conditions that (i) every vertex u for which f(u) is either 0 or 1 is adjacent to at least one vertex v for which f(v) =3. (ii) if u and v are two adjacent vertices and if f(u)=0 then f(v)≠0, similarly if f(u)=1 then f(v)≠1. The weight of an extended Roman domination function is the value ( ) Σ ( ) The minimum weight of an extended Roman domination function on graph G is called the extended Roman domination number of G, denoted by ( ).The Hexagonal networks are popular mesh-derived parallel architectures. In this paper we present an upper bound for the extended Roman domination number of hexagonal networks.