On metric dimension of convex polytopes with pendant edges. (Q2828971)

The authors study the metric dimension of some plane graphs which are obtained from some convex polytopes by attaching a pendant edge to each vertex of the outer cycle in a plane representation of these convex polytopes. A family \(\mathcal{G}\) of connected graphs is said to be a family with constant metric dimension if \(\dim(G)\) does not depend upon the choice of \(G\) in \(\mathcal{G}\). The authors prove that the metric dimension of some plane graphs is constant and it is enough to choose only three vertices appropriately to resolve all the vertices of these classes of graphs. The article poses an open problem as follows:NEWLINENEWLINE Open problem: Let \(G^\prime\) be a graph obtained from a plane representation \(G\) of a convex polytope by attaching a pendant edge to each vertex of the outer cycle of \(G\). Is it the case that \(\dim(G^\prime)=\dim(G)\) always holds?