On 2-metric resolvability in rotationally-symmetric graphs

Article type: Research Article

Authors: Bashir, Humera^a | Zahid, Zohaib^a | Kashif, Agha^{a; *} | Zafar, Sohail^a | Liu, Jia-Bao^b

Affiliations: [a] Department of Mathematics, University of Management and Technology, Lahore, Pakistan | [b] School of Mathematics and Physics, Anhui Jianzhu University, Hefei, P.R. China

Correspondence: [*] Corresponding author. Agha Kashif, Department of Mathematics, University of Management and Technology, Lahore, Pakistan. E-mail: kashif.khan@umt.edu.pk.

Abstract: 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.

Keywords: 2-metric dimension, rotationally symmetric, plane graphs

DOI: 10.3233/JIFS-210040

Journal: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 6, pp. 11887-11895, 2021