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.
BasakM., SahaL., DasG.K. and TiwariK., Fault-tolerant metric dimension of circulant graphs Cn(1, 2, 3), Theoret Comput Sci (2019), https://doi.org/10.1016/j.tcs.2019.01.011.
5.
BashirH., ZahidZ. and RashidT., Computation of 2-metric dimension of some families of graphs, Submitted.
6.
BlumenthalL.M., Theory and applications of distance geometry, Oxford University Press. (1953).
7.
ChartrandG. and ZhangP., The theory and applications of resolvability in graphs, A Survey Congressus Numerantium160 (2003), 47–68.
8.
ChaudhryM.A., JavaidI. and SalmanM., Fault-tolerant metric and partition dimension of graphs, Util Math83 (2010), 187–199.
9.
Estrado-MorenoA., Rodriguez-VelaquezJ.A. and YeroI.G., The–metric dimension of a graph, Applied Mathematics and Information Sciences9(6) (2015), 2829–2840.
10.
Estrado-MorenoA., YeroI.G. and Rodriguez-VelaquezJ.A., The–metric dimension of lexicographic product of graphs, Discrete Mathematics339(7) (2016), 1924–1934.
11.
Estrado-MorenoA., YeroI.G. and Rodriguez-VelaquezJ.A., The–metric dimension of corona product of graphs, Bull Malays Math Sci Soc39(1) (2016), 135–156.
12.
Estrado-MorenoA., YeroI.G. and Rodriguez-VelaquezJ.A., The k–metric dimension of graphs: a general approach, arXiv:1605.06709v2, (2016).
13.
Estrado-MorenoA., YeroI.G. and Rodriguez-VelaquezJ.A., Computing the–metric dimension of graphs, Applied Mathematics and Computation300 (2017), 60–69.
14.
Estrado-MorenoA., YeroI.G. and Rodriguez-VelaquezJ.A., On the k–metric dimension of Metric Spaces, arXiv:1603.04049v1, (2016).
15.
Estrado-MorenoA., YeroI.G. and Rodriguez-VelaquezJ.A., –metric resolvability in graphs, Electron Notes Discrete Math46 (2014), 121–128.
16.
Estrado-MorenoA., YeroI.G. and Rodriguez-VelaquezJ.A., Relationship between the 2–metric dimension and the 2–adjacency dimension in the lexicographic product of graphs, Graphs and Combinatorics32 (2016), 2367–2392.
17.
HararyF. and MelterR.A., On the metric dimension of a graph, Ars Combin2 (1976), 191–195.
18.
HernandoC., MoraM., SlaterP.J. and WoodD., Fault-tolerant metric dimension of graphs, Convexity in Discrete Structures5 (2008), 81–85.
19.
HuoC., BashirH., ZahidZ. and ChuY.M., On the 2-metric resolvability of graphs, AIMS Mathematics5(6) (2020), 6609–6619.
20.
ImranM., BukhariS.A.H. and BaigA.Q., Families of Rotationally-Symmetric Plane Graphs with Constant Metric Dimension, Southeast Asian Bulletin of Mathematics36 (2012), 663–675.
21.
ImranM., BukhariS.A.H. and BaigA.Q., On the meric dimension of rotationally-symmetric graph, Ars Combin124 (2016), 111–128.
22.
JavaidI., SalmanM., ChaudhryM.A. and ShokatS., Fault-Tolerance in resolvability, Utilitas Math80 (2009), 263–275.
23.
LiuJ.B., MunirM., AliI., HussainZ. and AhmedA., Fault-Tolerant Metric Dimension of Wheel related Graphs. <hal-01857316v2>, (2019).
24.
MajiD. and GhoraiG., Computing F-index, coindex and Zagreb polynomials of the kth generalized transformation graphs, Heliyon6(12) (2020).
25.
MajiD. and GhoraiG., A novel graph invariant: The third leap Zagreb index under several graph operations, Discrete Mathematics, Algorithms and Applications11(5) (2019).
26.
PritchardD. and VempalaS., Symmetric network computation, SPAA 06: Proceedings of the eighteenth annual ACM sym posium on Parallelism in algorithms and architectures, (2006).
27.
RazaH., HayatS., ImranM. and PanX., Fault-Tolerant resolvability and extremal structures of graphs, Mathematics7(1) (2019), 78.
28.
RazaH., HayatS. and PanX., On the fault-Tolerant metric dimension of convex polytopes, Applied Mathematics and Computation339 (2018), 172–185.
29.
RazaH., LiuJ.B. and QuS., On mixed metric dimension of rotationally symmetric graphs, IEEE Access8 (2020), 11560–11569.
30.
ShabbirA. and ZumfererscuT., Fault-tolerant designs in triangular lattice network, Discrete Math219 (2002), 179–189.
31.
SlaterP.J., Dominating and referece set in a graph, Journal of Mathematical and Physical Sciences22(4) (1988), 445–455.
32.
SlaterP.J., Leaves of trees, Congressus Numerantium14 (1975), 549–559.
