The Metric Dimension of Subdivisions of Lilly Graph, Tadpole Graph and Special Trees

Abstract

: Consider a robot that is navigating in a space represented by a graph and wants to know its current location. It can send a signal to find out how far it is from each set of fixed landmarks. We study the problem of computing the minimum number of landmarks required, and where they should be placed so that the robot can always determine its location. The set of nodes where the landmarks are located is called the metric basis of the graph, and the number of landmarks is called the metric dimension of the graph. On the other hand, the metric dimension of a graph G is the smallest size of a set B of vertices that can distinguish each vertex pair of G by the shortest-path distance to some vertex in B . The finding of the metric dimension of an arbitrary graph is an NP-complete problem. Also, the metric dimension has several applications in different areas, such as geographical routing protocols, network discovery and verification, pattern recognition, image processing, and combinatorial optimization. In this paper, we study the metric dimension of subdivisions of several graphs, including the Lilly graph, the Tadpole graph, and the special trees star tree, bistar tree, and coconut tree.