On the Geodesic Identification of Vertices in Convex Plane Graphs

A shortest path between two vertices and in a connected graph is a geodesic. A vertex of performs the geodesic identification for the vertices in a pair if either belongs to a geodesic or belongs to a geodesic. The minimum number of vertices performing the geodesic identification for each pair of vertices in is called the strong metric dimension of . In this paper, we solve the strong metric dimension problem for three convex plane graphs by performing the geodesic identification of their vertices.