On 2-metric resolvability in rotationally-symmetric graphs

The 2-metric resolvability is an extension of metric resolvability in graphs having several applications in intelligent systems for example network optimization, robot navigation and sensor networking. Rotationally symmetric graphs are important in intelligent networks due to uniform rate of data transformation to all nodes. In this article, 2-metric dimension of rotationally symmetric plane graphs Rn, Sn and Tn is computed and found to be independent of the number of vertices.