Metric dimension of linear polyomino chain
Aqsa Naeemf23mphilmath01739@s.rwu.edu.pkDepartment of MathematicsRawalpindi Women UniversityRawalpindi, 46000, Pakistan0009-0008-8510-1404View full profile → , Sarah Abdul Hameedsaraha.alkhafaji@uokufa.edu.iqDepartment of MathematicsFaculty of Computer Science and MathematicsUniversity of KufaNajaf, 540011, Iraq0009-0008-1873-4252View full profile → , Hussam Majid Shihab AlobaidiHusam.m.sh.alobaidi@aliraqia.edu.iqDepartment of Administrative and Financial AffairsAl-Iraqia UniversityBaghdad, 10071, Iraq0000-0002-4232-4180View full profile → , Deeba Afzaldeeba.afzal@f.rwu.edu.pkDepartment of MathematicsRawalpindi Women UniversityRawalpindi, 46000, Pakistan0000-0001-5268-7260View full profile → , Mohammad Reza Farahanimohammad_farahani@mathdep.iust.ac.irSchool of Mathematics and Computer ScienceIran University of Science and Technology (IUST)Narmak, Tehran, 16844, Iran0000-0003-2969-4280View full profile → , *Mehdi AlaeiyanCorresponding authoralaeiyan@iust.ac.irSchool of Mathematics and Computer ScienceIran University of Science and Technology (IUST)Narmak, Tehran, 16844, Iran0000-0003-2185-5967View full profile → , Murat Cancanmcancan@yyu.edu.trDepartment of MathematicsFaculty of EducationVan Yüzüncü Yıl UniversityVan, Turkey0000-0002-8606-2274View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Mar 2025
- Published Online:
- 04 Sep 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2300
- Pages:
- 1–11
Abstract
Metric dimension has applications in real life including robots, fiber optics, network designs, chemical structures etc. Metric dimension of graph is minimum amount of vertices required to construct resolving set by independently determining each other’s distances. The set is known as graph’s resolving set if each pair of vertices in G has unique representation. In this work, we find metric dimension of linear polyomino chain.
Keywords
Subject Classifications
References
[1] P. J. Slater, “Leaves of Trees,” in Proc. 6th Southeastern Conf. Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 14, pp. 549–559 (1975).
[2] F. Harary and R. A. Melter, “On the metric dimension of a graph,” Ars Combin., vol. 2, pp. 191–195 (1976).
[3] M. Feng, M. Xu, and K. Wang, “On the metric dimension of line graphs,” Discrete Appl. Math., vol. 161, no. 6, pp. 802–805 (2012), doi: 10.1016/j.dam.2012.10.018.
[4] A. Behtoei, S. Payrovi, and P. S. Batool, “Metric dimension of Andrásfai graphs,” arXiv preprint arXiv:1706.06852 (2017).
[5] B. Bollobás, D. Mitsche, and P. Prałat, “Metric dimension for random graphs,” Electron. J. Combin., vol. 20, no. 4 (2013), doi: 10.37236/2639.
[6] C. Hernando, M. Mora, I. M. Pelayo, C. Seara, J. Cáceres, and M. L. Puertas, “On the metric dimension of some families of graphs,” Electron. Notes Discrete Math., vol. 22, pp. 129–133 (2005), doi: 10.1016/j.endm.2005.06.024.
[7] G. Ali, R. Laila, and M. Ali, “Metric Dimension of Some Families of Graph,” Math. Sci. Lett., vol. 5, no. 1, pp. 99–102 (2016), doi: 10.18576/msl/050114.
[8] G. Chartrand, L. Eroh, M. A. Johnson, and O. R. Oellermann, “Resolvability in graphs and the metric dimension of a graph,” Discrete Appl. Math., vol. 105, no. 1–3, pp. 99–113 (2000), doi: 10.1016/S0166-218X(00)00198-0.
[9] F. Okamoto, B. Phinezy, and P. Zhang, “The local metric dimension of a graph,” Math. Bohem., vol. 135, no. 3, pp. 239–255 (2010).
[10] Z. Beerliova, F. Eberhard, T. Erlebach, A. Hall, M. Hoffmann, M. Mihalák, and L. S. Ram, “Network discovery and verification,” IEEE J. Sel. Areas Commun., vol. 24, no. 12, pp. 2168–2181 (2006), doi: 10.1109/JSAC.2006.884015.
[11] S. Khuller, B. Raghavachari, and A. Rosenfeld, “Landmarks in graphs,” Discrete Appl. Math., vol. 70, no. 3, pp. 217–229 (1996), doi: 10.1016/0166-218X(95)00106-2.
[12] M. Imran, A. Q. Baig, S. A. U. H. Bokhary, and I. Javaid, “On the metric dimension of circulant graphs,” Appl. Math. Lett., vol. 25, no. 3, pp. 320–325 (2012), doi: 10.1016/j.aml.2011.09.008.
[13] S. Ahmad, M. A. Chaudhry, I. Javaid, and M. Salman, “On the metric dimension of generalized Petersen graphs,” Quaest. Math., vol. 36, no. 3, pp. 421–435 (2013), doi: 10.2989/16073606.2013.779950.
[14] B. Mohamed and M. Amin, “The Metric Dimension of Subdivisions of Lilly Graph, Tadpole Graph and Special Trees,” Appl. Comput. Math., vol. 12, no. 1, pp. 9–14 (2023), doi: 10.11648/j.acm.20231201.12.
[15] S. Nazeer, M. Hussain, F. A. Alrawajeh, and S. Almotairi, “Metric Dimension on Path-Related Graphs,” Math. Probl. Eng., vol. 2021, pp. 1–12 (2021), doi: 10.1155/2021/2085778.
[16] Z. Ahmad, M. A. Chaudhary, A. Q. Baig, and M. A. Zahid, “On metric dimension of P(n, 2)*K1 graph,” J. Discrete Math. Sci. Cryptogr., vol. 24, no. 2, pp. 629–645 (2021), doi: 10.1080/09720529.2021.1907017.
[17] Z. Ahmad, M. A. Chaudhary, A. Q. Baig, and M. A. Zahid, “Fault-tolerant metric dimension of P(n, 2)*K1 graph,” J. Discrete Math. Sci. Cryptogr., vol. 24, no. 2, pp. 647–656 (2021), doi: 10.1080/09720529.2021.1899209.
[18] F. Chaudhry, M. N. Husin, F. Afzal, D. Afzal, M. Ehsan, M. Cancan, and M. R. Farahani, “M-polynomials and degree-based topological indices of tadpole graph,” J. Discrete Math. Sci. Cryptogr., vol. 24, no. 7, pp. 2059–2072 (2021), doi: 10.1080/09720529.2021.1984561.
[19] F. Chaudhry, I. Shoukat, D. Afzal, C. Park, M. Cancan, and M. R. Farahani, “M-polynomials and degree-based topological indices of the molecule copper(I) oxide,” J. Chem., vol. 2021, pp. 1–12 (2021), doi: 10.1155/2021/6679819.
[20] M. Alaeiyan, “Characteristics and eigenvalues of the newly defined Ala graph,” Phys. Scr., vol. 100, no. 5, pp. 055201–055209 (2025), doi: 10.1088/1402-4896/adc3d2.
[21] M. Imran, M. R. Farahani, M. Cancan, M. Alaeiyan, and A. Akgül, “On topological indices of certain families of graphs,” Phys. Scr., vol. 100, pp. 015208 (2025), doi: 10.1088/1402-4896/ad9065.
[22] L. M. Blumenthal, Theory and Applications of Distance Geometry. Oxford, U.K.: Clarendon Press (1953).
