Fault-Tolerant Partition Resolvability in Chemical Graphs

References

• H. W. Kroto, J. R. Heath, S. C. O’Brien, R. F. Curl, and R. E. Smalley, “C60: buckminsterfullerene,” Nature 318, no. 6042 (1985): 162–3. doi:10.1038/318162a0
   Web of Science ®Google Scholar
• F. Harary, and R. A. Melter, “On the Metric Dimension of a Graph,” Theory Comput. Syst. Ars Combinatoria 2 (1976): 191–5.
   Google Scholar
• P. J. Slater, “Leaves of Trees, In,” Proc. 6th Southeastern Conf. combinatorics, Graph Theory, and Computing, Congr. Numer 14 (1975): 549–59.
   Google Scholar
• G. Chartrand, E. Salehi, and P. Zhang, “The Partition Dimension of a Graph,” Aequationes Mathematicae 59, no. 1 (2000): 45–54. doi:10.1007/PL00000127
   Google Scholar
• A. E. Moreno, “On the, k-Partition Dimension of Graphs,” Theoretical computer science 806 (2020): 42–52.
   Web of Science ®Google Scholar
• G. Chartrand, L. Eroh, M. A. Johnson, and O. R. Oellermann, “Resolvability in Graphs and the Metric Dimension of a Graph,” Discrete Applied Mathematics 105, no. 1-3 (2000): 99–113. doi:10.1016/S0166-218X(00)00198-0
   Web of Science ®Google Scholar
• Z. Shao, S. M. Sheikholeslami, P. Wu, and J. B. Liu, “The Metric Dimension of Some Generalized Petersen Graphs,” Discrete Dynamics in Nature and Society 2018 (2018): 1–10. doi:10.1155/2018/4531958
   Web of Science ®Google Scholar
• S. Akhter, School of Natural Sciences, National University of Sciences and Technology, H-12 Islamabad, Pakistan, and R. Farooq, “Metric Dimension of Fullerene Graphs,” Electronic Journal of Graph Theory and Applications 7, no. 1 (2019): 91–103. doi:10.5614/ejgta.2019.7.1.7
   Web of Science ®Google Scholar
• C. Hernando, M. Mora, P. J. Slater, and D. R. Wood, “Fault-Tolerant Metric Dimension of Graphs,” in Proceedings, International Conference on Convexity in Discrete Structures, (Tiruchirappalli: Ramanujan Mathematical Society, 2008), 81–5.
   Google Scholar
• H. Raza, S. Hayat, M. Imran, and X. F. Pan, “Fault-Tolerant Resolvability and Extremal Structures of Graphs,” Math 7, no. 1 (2019): 78. doi: 10.3390/math7010078
   Google Scholar
• H. Raza, S. Hayat, and X. F. Pan, “On the Fault-Tolerant Metric Dimension of Convex Polytopes,” Journal of Applied Mathematics and Computing. 339 (2018): 172–85. doi:10.1016/j.amc.2018.07.010
   Google Scholar
• N. Seyedi, and H. R. Maimani, “Fault-Tolerant Metric Dimension of Circulant Graphs,” Facta Universitatis, Series: Mathematics and Informatics 34, no. 4 (2019): 781–8. doi:10.22190/FUMI1904781S
   Web of Science ®Google Scholar
• R. V. Voronov, Petrozavodsk State University, “The Fault-Tolerant Metric Dimension of the King’s Graph,” Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes 13, no. 3 (2017): 241–9. doi:10.21638/11701/spbu10.2017.302
   Web of Science ®Google Scholar
• M. Azeem, M. F. Nadeem, A. Khalil, and A. Ahmad, “On the Bounded Partition Dimension of Some Classes of Convex Polytopes,” Journal of Discrete Mathematical Sciences and Cryptography doi:10.1080/09720529.2021.1880692
   Web of Science ®Google Scholar
• J. B. Liu, M. F. Nadeem, and M. Azeem, “Bounds on the Partition Dimension of Convex Polytopes,” Combinatorial Chemistry & High Throughput Screening 25, no. 3 (2020): 547–553. doi:10.2174/1386207323666201204144422
   Web of Science ®Google Scholar
• N. Mehreen, R. Farooq, and S. Akhter, School of Natural Sciences, National University of Sciences and Technology, H-12 Islamabad, Pakistan. “On the Partition Dimension of Fullerene Graphs,” AIMS Mathematics 3, no. 3 (2018): 343–52. doi:10.3934/Math.2018.3.343
   Web of Science ®Google Scholar
• H. M. A. Siddiqui, and M. Imran, “Computation of Metric Dimension and Partition Dimension of Nanotubes,” Journal of Computational and Theoretical Nanoscience 12, no. 2 (2015): 199–203. doi:10.1166/jctn.2015.3717
   Google Scholar
• H. M. A. Siddiqui, and M. Imran, “Computing Metric and Partition Dimension of 2- Dimensional Lattices of Certain Nanotubes,” Journal of Computational and Theoretical Nanoscience 11, no. 12 (2014): 2419–23. doi:10.1166/jctn.2014.3656
   Google Scholar
• C. Wei, M. F. Nadeem, H. M. A. Siddiqui, M. Azeem, J. B. Liu, and A. Khalil, “On Partition Dimension of Some Cycle-Related Graphs,” Mathematical Problems in Engineering 2021 (2021): 1–8. vol. Article ID 4046909 pages, doi:10.1155/2021/4046909
   Web of Science ®Google Scholar
• A. Nadeem, A. Kashif, S. Zafar, and Z. Zahid, “On 2-Partition Dimension of the Circulant Graphs,” Journal of Intelligent & Fuzzy Systems. 60, no 2, (2021): 180–184. doi:10.3233/JIFS-201982
   Google Scholar
• M. R. Garey, and D. S. Johnson, “Computers and Intractability,” A Guide to the Theory of NP-Completeness. (New York: Freeman, 1979).
   Google Scholar
• S. Khuller, B. Raghavachari, and A. Rosenfeld, “Landmarks in Graphs,” Discrete Applied Mathematics 70, no. 3 (1996): 217–29. doi:10.1016/0166-218X(95)00106-2
   Web of Science ®Google Scholar
• M. Salman, I. Javaid, M. Chaudhry, and S. Shokat, “Fault-Tolerance in Resolvability,” Utilitas Mathematica 80 (2009): 263–75.
   Web of Science ®Google Scholar
• I. Javaid, M. Salman, and M. A. Chaudhry, “Graphs of Order n with Fault-Tolerant Partition Dimension n – 1,” UPB Scientific Bulletin, Series A 76, no. 3 (2014): 159–168.
   Google Scholar
• K. Azhar, S. Zafar, and A. Kashif, “On Fault-Tolerent Partition Dimension of Homogeneous Caterpillar Graphs,” Mathematical Problems in Engineering 2021 (2021): 1–7. doi:10.1155/2021/7282245
   Web of Science ®Google Scholar
• K. Azhar, S. Zafar, A. Kashif, and M. Ojiema, “Fault-Tolerant Partition Resolvability of Cyclic Networks,” Journal of Mathematics. 2021 (2021): 1–8. doi:10.1155/2021/7237168
   Web of Science ®Google Scholar
• K. Azhar, S. Zafar, A. Kashif, and Z. Zahid, “On Fault-Tolerent Partition Dimension of Graphs,” Journal of Intelligent & Fuzzy Systems 40, no. 1 (2021): 1129–35. doi:10.3233/JIFS-201390
   Web of Science ®Google Scholar
• Z. Hussain, S. M. Kang, M. Rafique, M. Munir, U. Ali, A. Zahid, and M. S. Saleem, “Bounds for Partition Dimension of M-Wheels,” Open Physics 17, no. 1 (2019): 340–4. doi:10.1515/phys-2019-0037
   Web of Science ®Google Scholar
• M. Salman, I. Javaid, and M. Chaudhry, “Fault-Tolerant Metric and Partition Dimension of Graphs,” Utilitas Mathematica 83 (2010): 187–99.
   Web of Science ®Google Scholar
• R. Suryaningsih, and E. T. Baskoro, “The Locating- Chromatic Number and Partition Dimension of Fibonacene Graphs,” Indonesian Journal of Combinatorics 3, no. 2 (2020): 116–25. doi:10.19184/ijc.2019.3.2.5
   Google Scholar
• M. F. Nadeem, M. Hassan, M. Azeem, S. Ud-Din Khan, M. R. Shaik, M. A. F. Sharaf, A. Abdelgawad, and E. M. Awwad, “Application of Resolvability Technique to Investigate the Different Polyphenyl Structures for Polymer Industry,” Journal of Chemistry. 2021 (2021): 1–8. Article ID 6633227, pages, doi:10.1155/2021/6633227
   Web of Science ®Google Scholar