On the metric dimension of two families of convex polytopes
Muhammad Aslam Malik, Musavarah Sarwar · Afrika Matematika · 2015
A distance between two vertices of a connected graph is the shortest distance between them. The metric dimension of a connected graph G is the minimum cardinality of a subset W of vertices of G such that all vertices are uniquely determined by their distances from W. A family $$\mathcal {G}$$ of connected graphs is a family with constant metric dimension if dim(G) is finite and does not depend upon the choice of G in $$\mathcal {G}$$ . In this paper we study the metric dimension of two classes of convex polytopes and show that these classes of convex polytopes have constant metric dimension.