Metric Dimension of Some Generalized Families of Toeplitz Graphs

摘要

The metric dimension of a graph G is the selection of the minimum possible number of vertices such that each vertex of the graph G is distinctively defined by its vector of distances to the set of selected vertices. It was proved that the problem of determining the metric dimension of a graph is NP-hard. In this paper, the metric dimension of Toeplitz graphs with two and three generators is discussed and the exact values are found. Also, two conjectures about the exact metric dimension of Toeplitz graphs are given.