Computing the metric dimension of gear graphs (Q2333612)

Summary: Let \(G=(V,E)\) be a connected graph and \(d(u,v)\) denote the distance between the vertices \(u\) and \(v\) in \(G\). A set of vertices \(W\) resolves a graph \(G\) if every vertex is uniquely determined by its vector of distances to the vertices in \(W\). A metric dimension of \(G\) is the minimum cardinality of a resolving set of \(G\) and is denoted by \(\operatorname{dim}(G)\). Let \(J_{2n,m}\) be a \(m\)-level gear graph obtained by \(m\)-level wheel graph \(W_{2n,m}\cong mC_{2n}+k_1\) by alternatively deleting \(n\) spokes of each copy of \(C_{2n}\) and \(J_{3n}\) be a generalized gear graph obtained by alternately deleting \(2n\) spokes of the wheel graph \(W_{3n}\). In this paper, the metric dimension of certain gear graphs \(J_{2n,m}\) and \(J_{3n}\) generated by wheel has been computed. Also this study extends the previous result given by \textit{I. Tomescu} and \textit{I. Javaid} [Bull. Math. Soc. Sci. Math. Roum., Nouv. Sér. 50(98), No. 4, 371--376 (2007; Zbl 1164.05019)].