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. 3 Issue 2 Date of Publication:   June 2014

On Strong Metric Dimension of Diametrically Ver-tex Uniform Graphs

Cyriac Grigorious,Sudeep Stephen

Page(s):   114-116 ISSN:   2278-2397
DOI:   10.20894/IJCOA.101.003.002.004 Publisher:   Integrated Intelligent Research (IIR)

A pair of vertices u, v is said to be strongly resolved by a vertex s, if there exist at least one shortest path from s to u passing through v, or a shortest path from s to v passing through u. A set W⊆V, is said to be a strong metric generator if for all pairs u, v ∈/ W, there exist some element s ∈ W such that s strongly resolves the pair u, v. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. The strong met-ric dimension (metric dimension) problem is to find a min-imum strong metric basis (metric basis) in the graph. In this paper, we solve the strong metric dimension and the metric dimension problems for the circulant graph C (n, {1, 2 . . . j}), 1 ≤ j ≤ ⌊n/2⌋, n ≥ 3 and for the hyper-cubes. We give a lower bound for the problem in case of diametrically uniform graphs. The class of diametrically uniform graphs includes vertex transitive graphs and hence Cayley graphs.