ON THE METRIC DIMENSION OF A CLASS OF PLANAR GRAPHS

Let H = (V, E) be a non-trivial connected graph with vertex set V and edge set E. A set of ordered vertices [R.sub.m] from V (H) is said to be a resolving set for H if each vertex of H is uniquely determined by its vector of distances to the vertices of [R.sub.m]. The number of vertices in a smalles...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 13; no. 4; p. 1298
Main Authors Sharma, S.K, Bhat, V.K
Format Journal Article
LanguageEnglish
Published Turkic World Mathematical Society 01.09.2023
Subjects
Fuzzy sets
Graph theory
Mathematical research
Set theory
India
Online AccessGet full text

Cover

More Information
Summary:Let H = (V, E) be a non-trivial connected graph with vertex set V and edge set E. A set of ordered vertices [R.sub.m] from V (H) is said to be a resolving set for H if each vertex of H is uniquely determined by its vector of distances to the vertices of [R.sub.m]. The number of vertices in a smallest resolving set is called the metric dimension of H. In this article, we study the metric dimension for a rotationally symmetric family of planar graphs, each of which is shown to have an independent minimum resolving set of cardinality three. Keywords: Resolving set, metric dimension, rotationally symmetric plane graph, independent set. AMS Subject Classification: 05C12, 05C90.
ISSN:2146-1147