R-sets and metric dimension of necklace graphs

Ioan Tomescu; Muhammad Imran

doi:10.12785/amis/090109

R-sets and metric dimension of necklace graphs

Ioan Tomescu
, Muhammad Imran

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

20 Citations (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 Ne_n 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/090109
Publication status	Published - 2015
Externally published	Yes

Keywords

Diameter
Exchange property
Metric dimension
Necklace graph
R-set

ASJC Scopus subject areas

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

Access to Document

10.12785/amis/090109

Cite this

@article{201e4c97322443b9bc36a84174c2bffc,

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 = "Diameter, Exchange property, Metric dimension, Necklace graph, R-set",

author = "Ioan Tomescu and Muhammad Imran",

note = "Publisher Copyright: {\textcopyright} 2015 NSP.",

year = "2015",

doi = "10.12785/amis/090109",

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

Y1 - 2015

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 - Diameter

KW - Exchange property

KW - Metric dimension

KW - Necklace graph

KW - R-set

UR - https://www.scopus.com/pages/publications/84907228528

UR - https://www.scopus.com/pages/publications/84907228528#tab=citedBy

U2 - 10.12785/amis/090109

DO - 10.12785/amis/090109

M3 - Article

AN - SCOPUS:84907228528

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