ON THE STRONG METRIC DIMENSION OF A LOLLIPOPGRAPH, A GENERALIZED WEB GRAPH, AND AGENERALIZED FLOWER GRAPHTiffani Arzaqi Putri and Tri Atmojo KusmayadiDepartment of MathematicsFaculty of Mathematics and Natural SciencesSebelas Maret UniversityAbstract. Let G be a connected graph with vertex set V (G) and edge set E(G). Theinterval I[u; v] between u and v to be the collection of all vertices that belong to someshortest u − v path. A vertex s strongly resolves two vertices u and v if u belongs to ashortest v − s path, denoted by u ∈ I[v; s] or v belongs to a shortest u − s path, denotedby v ∈ I[u; s]. A vertex set S of G is a strong resolving set of G if every two distinctvertices of G are strongly resolved by some vertex of S. The strong metric basis of G is astrong resolving set with minimal cardinality. The strong metric dimension sdim(G) of agraph G is de ned as the cardinality of strong metric basis. In this paper we determinethe strong metric dimension of lollipop Lm;n graph, generalized web WB(G; m; n) graph,and generalizedower FL(G; m; n; p) graph.Keywords : strong metric dimension, strong resolving, lollipop graph, generalized webgraph, generalizedower graph1.