Computing the metric dimension of convex polytopes generated by wheel related graphs (Q2400091)

An ordered set \(W\) of vertices of a graph \(G\) is called a resolving set or locating set for \(G\) if every vertex is uniquely determined by its vector of distances to the vertices in \(W\). A resolving set of minimum cardinality is called a metric basis for \(G\) and this cardinality is the metric dimension or location number of \(G\). The metric dimension of certain wheel related graphs has been computed recently in \textit{S. Afzal} et al. [Appl. Math. Comput. 242, 624--632 (2014; Zbl 1334.05133)]. The present paper extends this study to infinite classes of convex polytopes generated by wheel or gear graphs. These results add further support to a negative answer of an open problem raised in \textit{M. Imran} et al. [Comput. Math. Appl. 60, No. 9, 2629--2638 (2010; Zbl 1205.05067)]. It is shown that these infinite classes of convex polytopes generated by wheel related graphs have unbounded metric dimension. It is natural to ask for the characterization of graphs with unbounded metric dimension.