paper

Strong metric dimension of generalized Jahangir graph

arXiv:1905.03975

Abstract

Let be a simple and connected graph with vertex set . A vertex strongly resolves two vertices if belongs to a shortest path or belongs to a shortest path. A set is a strong resolving set for if every pair of vertices of is strongly resolved by some vertex of . A strong metric basis of is a strong resolving set for with minimum cardinality. The strong metric dimension of , denoted by , is the cardinality of a strong metric basis of . In this paper we compute the strong metric dimension of generalized Jahangir graph , where and .

Strong metric dimension of generalized Jahangir graph · wovepaper