The similarity of metric dimension and local metric dimension of rooted product graph

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

Abstract

Let G be a connected graph with vertex set V(G) and W = {w1, w2,..., wk}⊂V(G). The representation of a vertex v∈V(G) with respect to W is the ordered k-tuple r(v |W) = (d(v, w1), d(v, w2),..., d(v, wk )), where d(v, w) represents the distance between vertices v and w. The set W is called a resolving set for G if every vertex of G has a distinct representation. A resolving set containing a minimum number of vertices is called basis for G. The metric dimension of G, denoted by dim(G), is the number of vertices in a basis of G. If every two adjacent vertices of G have a distinct representation with respect to W, then the set W is called a local resolving set for G and the minimum local resolving set is called a local basis of G. The cardinality of a local basis of G is called local metric dimension of G, denoted by diml (G). In this paper, we study the local metric dimension of rooted product graph and the similarity of metric dimension and local metric dimension of rooted product graph.

Original languageEnglish
Pages (from-to)841-856
Number of pages16
JournalFar East Journal of Mathematical Sciences
Volume97
Issue number7
DOIs
Publication statusPublished - 2 Jul 2015

Keywords

  • Basis
  • Local basis
  • Local resolving set
  • Resolving set
  • Rooted product graph

Fingerprint

Dive into the research topics of 'The similarity of metric dimension and local metric dimension of rooted product graph'. Together they form a unique fingerprint.

Cite this