R-Sets and Metric Dimension of Necklace Graphs

Ioan Tomescu; Muhammad Imran

doi:10.12785/AMIS/010109

R-Sets and Metric Dimension of Necklace Graphs

Ioan Tomescu, Muhammad Imran

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

The R-set relative to a pair of distinct vertices of a connected graph G is the set of vertices whose distances to these vertices are distinct. In this paper R-sets are used to show that metric dimension dim(Ne_n) = 3 when n is odd and 2 otherwise, where Ne_n is the necklace graph of order 2n + 2. It is also shown that the exchange property of the bases in a vector space does not hold for minimal resolving sets of Nen if n is even.

Original language	English
Pages (from-to)	63-67
Number of pages	5
Journal	Applied Mathematics and Information Sciences
Volume	9
Issue number	1
DOIs	https://doi.org/10.12785/AMIS/010109
Publication status	Published - Jan 2015
Externally published	Yes

Keywords

Metric dimension
R-set
diameter
exchange property
necklace graph

ASJC Scopus subject areas

Analysis
Numerical Analysis
Computer Science Applications
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.12785/AMIS/010109

Cite this

@article{64b367c28d8d4bcba962dbc7800787d9,

title = "R-Sets and Metric Dimension of Necklace Graphs",

abstract = "The R-set relative to a pair of distinct vertices of a connected graph G is the set of vertices whose distances to these vertices are distinct. In this paper R-sets are used to show that metric dimension dim(Nen) = 3 when n is odd and 2 otherwise, where Nen is the necklace graph of order 2n + 2. It is also shown that the exchange property of the bases in a vector space does not hold for minimal resolving sets of Nen if n is even.",

keywords = "Metric dimension, R-set, diameter, exchange property, necklace graph",

author = "Ioan Tomescu and Muhammad Imran",

year = "2015",

month = jan,

doi = "10.12785/AMIS/010109",

language = "English",

volume = "9",

pages = "63--67",

journal = "Applied Mathematics and Information Sciences",

issn = "1935-0090",

publisher = "Natural Sciences Publishing",

number = "1",

}

TY - JOUR

T1 - R-Sets and Metric Dimension of Necklace Graphs

AU - Tomescu, Ioan

AU - Imran, Muhammad

PY - 2015/1

Y1 - 2015/1

N2 - The R-set relative to a pair of distinct vertices of a connected graph G is the set of vertices whose distances to these vertices are distinct. In this paper R-sets are used to show that metric dimension dim(Nen) = 3 when n is odd and 2 otherwise, where Nen is the necklace graph of order 2n + 2. It is also shown that the exchange property of the bases in a vector space does not hold for minimal resolving sets of Nen if n is even.

AB - The R-set relative to a pair of distinct vertices of a connected graph G is the set of vertices whose distances to these vertices are distinct. In this paper R-sets are used to show that metric dimension dim(Nen) = 3 when n is odd and 2 otherwise, where Nen is the necklace graph of order 2n + 2. It is also shown that the exchange property of the bases in a vector space does not hold for minimal resolving sets of Nen if n is even.

KW - Metric dimension

KW - R-set

KW - diameter

KW - exchange property

KW - necklace graph

UR - http://www.scopus.com/inward/record.url?scp=85108507490&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85108507490&partnerID=8YFLogxK

U2 - 10.12785/AMIS/010109

DO - 10.12785/AMIS/010109

M3 - Article

AN - SCOPUS:85108507490

SN - 1935-0090

VL - 9

SP - 63

EP - 67

JO - Applied Mathematics and Information Sciences

JF - Applied Mathematics and Information Sciences

IS - 1

ER -

R-Sets and Metric Dimension of Necklace Graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this