English

Strong metric dimension of generalized Jahangir graph

Combinatorics 2019-05-13 v1

Abstract

Let GG be a simple and connected graph with vertex set V(G)V(G). A vertex wV(G)w\in V(G) strongly resolves two vertices u,vV(G)u,v \in V(G) if vv belongs to a shortest uwu-w path or uu belongs to a shortest vwv-w path. A set WV(G)W \subseteq V(G) is a strong resolving set for GG if every pair of vertices of GG is strongly resolved by some vertex of WW. A strong metric basis of GG is a strong resolving set for GG with minimum cardinality. The strong metric dimension of GG, denoted by sdim(G)sdim(G), is the cardinality of a strong metric basis of GG. In this paper we compute the strong metric dimension of generalized Jahangir graph J(n,m)J(n,m), where m3m\geq 3 and n2n\geq 2.

Keywords

Cite

@article{arxiv.1905.03975,
  title  = {Strong metric dimension of generalized Jahangir graph},
  author = {Rashid Farooq and Naila Mehreen},
  journal= {arXiv preprint arXiv:1905.03975},
  year   = {2019}
}