Localisation of honeycomb rectangular torus

References

• L. Euler, Comment. Acad. Sci. Petropol. 7, 128–140 (1741).
   Google Scholar
• F. Harary, A Seminar on Graph Theory. (Courier Dover Publications, 2015).
   Google Scholar
• F. Harary, IRE Trans. Inf. Theory 5, 95–109 (1959). doi:10.1109/TIT.1959.1057541
   Google Scholar
• D. Bonchev, Chemical Graph Theory: Introduction and Fundamentals. Vol. 1. (CRC Press, 1991).
   Google Scholar
• N. Trinajstic, Chemical Graph Theory (CRC Press, 2018).
   Google Scholar
• K.O. May, Isis 56, 346–348 (1965). doi:10.1086/350003
   Web of Science ®Google Scholar
• E.W. Weisstein, Four-color theorem (2002). Available at https://mathworld.wolfram.com/.
   Google Scholar
• L.R. Foulds, Graph Theory Applications (Springer Science Business Media, 2012).
   Google Scholar
• M. Azeem, M. Imran and M.F. Nadeem, J. King Saud. Univ. Sci. 34, 101779 (2022). doi:10.1016/j.jksus.2021.101779
   Web of Science ®Google Scholar
• M. Azeem and M.F. Nadeem, Eur. Phys. J. Plus 136, 14 (2021).
   Google Scholar
• A. Shabbir and M. Azeem, IEEE Access 9, 55644–55653 (Apr 2021). doi:10.1109/ACCESS.2021.3071716
   Web of Science ®Google Scholar
• M. Azeem, M.K. Jamil, A. Javed and A. Ahmad, J. Math. 2022, 18 (July 2022). doi:10.1155/2022/8238651
   Google Scholar
• P.J Slater, Congr. Numer 14, 549–559 (1975).
   Google Scholar
• F. Harary and A.M. Robert, Ars Comb. 2, 191–195 (1976).
   Google Scholar
• M.O. Franz and H.A. Mallot, Rob. Auton. Syst. 30, 133–153 (2000). doi:10.1016/S0921-8890(99)00069-X
   Web of Science ®Google Scholar
• A.T. Balaban, J. Chem. Inf. Comput. Sci. 25, 334–343 (1985). doi:10.1021/ci00047a033
   Google Scholar
• C. Hart, Graph Theory Topics in Computer Networking. (University of Houston-Downtown, Department Computer and Mathematical Sciences, Senior Project 2013: 13–20).
   Google Scholar
• D. Avis, A. Hertz and O. Marcotte, Graph Theory and Combinatorial Optimization. Vol. 8 (Springer Science & Business Media, 2005).
   Google Scholar
• F. Buckley, Coll. Math. J. 18, 24–32 (1987). doi:10.1080/07468342.1987.11973002
   Google Scholar
• F.F. Wu, N. Yixin and W. Ping, IEEE Trans. Power Syst. 15, 923–929 (2000). doi:10.1109/59.871714
   Web of Science ®Google Scholar
• W.-C. Chang, Y.-D. Chiu and M.-F. Li, Learning Kruskal's Algorithm, Prim's Algorithm and Dijkstra's Algorithm by board game. (International Conference on Web-based Learning. Springer, Berlin, Heidelberg, 2008).
   Google Scholar
• S. Bukhari, M.K. Jamil, M. Azeem and S. Swaray, IEEE Access 11, 4478–4485 (Jan 2023). doi:10.1109/ACCESS.2023.3235398
   Web of Science ®Google Scholar
• M. Imran, A. Ahmad, M. Azeem and K. Elahi, Comput. Mater. Contin. 71, 2053–2071 (Sept. 2021). doi:10.32604/cmc.2022.022064
   Web of Science ®Google Scholar
• J.L. Gross, J. Yellen and M. Anderson, Graph Theory and Its Applications (Chapman and Hall/CRC, 2018).
   Google Scholar
• D.P. Scharf, F.Y. Hadaegh and S.R. Ploen, A survey of spacecraft formation flying guidance and control (part I): Guidance; 2003.
   Google Scholar
• J. Smith, et al. IEEE. Comput. Graph. Appl. 18, 54–60 (1998). doi:10.1109/38.674972
   Web of Science ®Google Scholar
• D.S. Chiu, Y. Takahashi and J.E. Mark, Polymer 17, 670–672 (1976). doi:10.1016/0032-3861(76)90205-6
   Web of Science ®Google Scholar
• M.A. Mohammed, et al. Eurasian Chem. Commun. 2, 1064–1071 (2020).
   Google Scholar
• J. Caceres, et al. SIAM J. Discrete Math. 21, 423–441 (2007). doi:10.1137/050641867
   Web of Science ®Google Scholar
• Z. Beerliova, et al. IEEE J. Sel. Areas Commun. 24, 2168–2181 (2006). doi:10.1109/JSAC.2006.884015
   Web of Science ®Google Scholar
• F.L. Stahura and J. Bajorath, Curr. Med. Chem. 10, 707–715 (2003). doi:10.2174/0929867033457881
   PubMed Web of Science ®Google Scholar
• E.M. Bolger, Int. J. Game Theory 18, 37–44 (1989). doi:10.1007/BF01248494
   Web of Science ®Google Scholar
• R.A. Melter and I. Tomescu, Comput. Vision, Graph. Image Process. 25, 113–121 (1984). doi:10.1016/0734-189X(84)90051-3
   Google Scholar
• H. Raza, S. Hayat and X.F. Pan, J. Appl. Math. Comput. 60, 517–535 (2019). doi:10.1109/ACCESS.2020.3014883
   Web of Science ®Google Scholar
• H. Raza, S. Hayat, M. Imran and X.F. Pan, Mathematics 7, 78–97 (2019). doi:10.3390/math7010078
   Web of Science ®Google Scholar
• H. Raza, S. Hayat and X.F. Pan, Appl. Math. Comput. 339, 172–185 (2018). doi:10.1016/j.amc.2018.07.010
   Web of Science ®Google Scholar
• H.M.A. Siddiqui, S. Hayat, A. Khan, M. Imran, A. Razzaq and J.-B. Liu, Theor. Comput. Sci. 796, 114–128 (3 December 2019). doi:10.1016/j.tcs.2019.08.032
   Web of Science ®Google Scholar
• S. Hayat, A. Khan and Y. Zhong, Mathematics 10, 1815 (2022). doi:10.3390/math10111815
   Google Scholar
• S. Hayat, A. Khan, M.Y.H. Malik, M. Imran and M.K. Siddiqui, IEEE Access 8, 145435–145445 (2020). doi:10.1109/ACCESS.2020.3014883
   Web of Science ®Google Scholar
• M. Azeem, M.K. Jamil and Y. Shang, Mathematics 11, 844 (2023). doi:10.3390/math11040844
   Web of Science ®Google Scholar
• C. Tennenhouse, Australas. J. Comb. 63, 115–129 (2015).
   Google Scholar
• R. Manjusha and A. Sunny Kuriakose, Int. J. Appl. Graph Theory Wireless Ad Hoc Netw. Sens. Netw. (GRAPH-HOC) 7, 1–9 (2015).
   Google Scholar
• T. Laihonen, Inf. Process. Lett. 116, 694–700 (2016). doi:10.1016/j.ipl.2016.06.002
   Web of Science ®Google Scholar
• J. Geneson, Discrete Appl. Math. 284, 1–7 (2020). doi:10.1016/j.dam.2020.03.001
   Web of Science ®Google Scholar
• A.N.A. Koam, et al. IEEE Access 9, 81527–81534 (2021). doi:10.1109/ACCESS.2021.3085584
   Web of Science ®Google Scholar
• M. Jannesari and B. Omoomi, Characterization of n-vertex graphs with metric dimension n-3. arXiv preprint arXiv:1103.3588 (2011).
   Google Scholar
• S.W. Saputro, et al. The metric dimension of regular bipartite graphs. arXiv preprint arXiv:1101.3624 (2011).
   Google Scholar
• B. Bollobas, D. Mitsche and P. Pralat, Metric dimension for random graphs. arXiv preprint arXiv:1208.3801 (2012).
   Google Scholar
• F. Simonraj and A. George, Int. J. Appl. Graph Theory Wireless Ad Hoc Netw. Sens. Netw. 4, 11 (2012).
   Google Scholar
• H.M.A. Siddiqui and M. Imran, J. Comput. Theor. Nanosci. 11, 2419–2423 (2014). doi:10.1166/jctn.2014.3656
   Google Scholar
• M. Feng, X. Ma and K. Wang, Eur. J. Comb. 43, 82–97 (2015). doi:10.1016/j.ejc.2014.08.019
   Web of Science ®Google Scholar
• M. Heydarpour and S. Maghsoudi, Bull. Aust. Math. Soc. 91, 508–513 (2015). doi:10.1017/S0004972714001129
   Web of Science ®Google Scholar
• N. Zubrilina, On the edge metric dimension for the random graph. arXiv preprint arXiv:1612.06936 (2016).
   Google Scholar
• S. Hoffmann, A. Elterman and E. Wanke, Theor. Comput. Sci. 630, 43–62 (2016). doi:10.1016/j.tcs.2016.03.024
   Web of Science ®Google Scholar
• M. Idrees, et al. Generalized Mö bius Ladder and Its Metric Dimension. arXiv preprint arXiv:1708.05199 (2017).
   Google Scholar
• M. Munir, et al. Ars Comb. 135, 249–256 (2017).
   Web of Science ®Google Scholar
• M. Milivojevic Danas, The difference between several metric dimension graph invariants. arXiv e-prints (2020): arXiv-2012.
   Google Scholar