Let G be a connected simple graph with vertex set    and edge set  A vertex s is said to strongly resolve a pair of vertices u and v if there exists some shortest  path containing u or some shortest  path containing v. A set S is called a strong resolving set for G if some vertices of S strongly resolve every pair of distinct vertices from G.Strong metric dimension is the smallest cardinality of a strong resolving set denoted by  In this paper, we determine the strong metric dimensions of some graphs, namely, sunflower, t-fold wheel, helm, and friendship.

strong resolvingset, strong metricdimension, sunflower, t-fold wheel, helm, friendship.