{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T08:07:52Z","timestamp":1768810072123,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T00:00:00Z","timestamp":1542758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s12190-018-01225-y","type":"journal-article","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T09:11:11Z","timestamp":1542791471000},"page":"517-535","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":66,"title":["On the fault-tolerant metric dimension of certain interconnection networks"],"prefix":"10.1007","volume":"60","author":[{"given":"Hassan","family":"Raza","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6842-7604","authenticated-orcid":false,"given":"Sakander","family":"Hayat","sequence":"additional","affiliation":[]},{"given":"Xiang-Feng","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"issue":"2","key":"1225_CR1","doi-asserted-by":"publisher","first-page":"637","DOI":"10.18514\/MMN.2015.1087","volume":"16","author":"A Ahmad","year":"2015","unstructured":"Ahmad, A., Imran, M., Al-Mushayt, O., Bokhary, S.A.U.H.: On the metric dimension of barycentric subdividion of Cayley graph $$Cay(\\mathbb{Z}_n\\oplus \\mathbb{Z}_m)$$ C a y ( Z n \u2295 Z m ) . Miskolc. Math. Notes 16(2), 637\u2013646 (2015)","journal-title":"Miskolc. Math. Notes"},{"key":"1225_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1112\/blms\/bdq096","volume":"43","author":"RF Bailey","year":"2011","unstructured":"Bailey, R.F., Cameron, P.J.: Basie size, metric dimension and other invariants of groups and graphs. Bull. London Math. Soc. 43, 209\u2013242 (2011)","journal-title":"Bull. London Math. Soc."},{"issue":"4","key":"1225_CR3","first-page":"97","volume":"13","author":"RF Bailey","year":"2011","unstructured":"Bailey, R.F., Meagher, K.: On the metric dimension of Grassmann graphs. Discrete Math. Theor. Comput. Sci. 13(4), 97\u2013104 (2011)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"1225_CR4","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z Beerloiva","year":"2006","unstructured":"Beerloiva, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihal\u00e1k, M., Ram, L.: Network discovery and verification. IEEE J. Sel. Area Commun. 24, 2168\u20132181 (2006)","journal-title":"IEEE J. Sel. Area Commun."},{"key":"1225_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"1225_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.endm.2009.11.004","volume":"35","author":"J C\u00e1ceres","year":"2009","unstructured":"C\u00e1ceres, J., Hernando, C., Mora, M., Pelayoe, I.M., Puertas, M.L.: On the metric dimension of infinite graphs. Electron. Notes Discrete Math. 35, 15\u201320 (2009)","journal-title":"Electron. Notes Discrete Math."},{"key":"1225_CR7","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/050641867","volume":"21","author":"J C\u00e1ceres","year":"2007","unstructured":"C\u00e1ceres, J., Hernando, C., Mora, M., Pelayoe, I.M., Puertas, M.L., Seara, C., Wood, D.R.: On the metric dimension of cartesian products of graphs. SIAM J. Discrete Math. 21, 423\u2013441 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"1225_CR8","unstructured":"Chartrand, G., Zhang, P.: The theory and applications of resolvability in graphs: A survey. In: Proceedings of the 34th Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 160, 47\u201368 (2003)"},{"key":"1225_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","volume":"150","author":"G Chartrand","year":"2000","unstructured":"Chartrand, G., Eroh, L., Johnson, M.A., Oellermann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 150, 99\u2013113 (2000)","journal-title":"Discrete Appl. Math."},{"key":"1225_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/12.46277","volume":"39","author":"MS Chen","year":"1990","unstructured":"Chen, M.S., Shin, K.G., Kandlur, D.D.: Addressing, routing and broadcasting in hexagonal mesh multiprocessors. IEEE Trans. Comput. 39, 10\u201318 (1990)","journal-title":"IEEE Trans. Comput."},{"key":"1225_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.disc.2005.09.015","volume":"306","author":"M Fehr","year":"2006","unstructured":"Fehr, M., Gosselin, S., Oellermann, O.: The metric dimension of Cayley digraphs. Discrete Math. 306, 31\u201341 (2006)","journal-title":"Discrete Math."},{"key":"1225_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"1225_CR13","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combin. 2, 191\u2013195 (1976)","journal-title":"Ars Combin."},{"key":"1225_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.cplett.2017.09.055","volume":"688","author":"S Hayat","year":"2017","unstructured":"Hayat, S.: Computing distance-based topological descriptors of complex chemical networks: new theoretical techniques. Chem. Phys. Lett. 688, 51\u201358 (2017)","journal-title":"Chem. Phys. Lett."},{"key":"1225_CR15","first-page":"144","volume":"18","author":"S Hayat","year":"2015","unstructured":"Hayat, S., Malik, M.A., Imran, M.: Computing topological indices of honeycomb derived networks. Rom. J. Inf. Sci. Technol. 18, 144\u2013165 (2015)","journal-title":"Rom. J. Inf. Sci. Technol."},{"key":"1225_CR16","unstructured":"Hernando, C., Mora, M., Slater, P.J., Wood, D.R.: Fault-tolerant metric dimension of graphs. In: Proceedings of International Conference on Convexity in Discrete Structures, Ramanujan Mathematical Society Lecture Notes, pp. 81\u201385. May (2008)"},{"key":"1225_CR17","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s10474-016-0606-1","volume":"149","author":"M Imran","year":"2016","unstructured":"Imran, M., Siddiqui, H.M.A.: Computing the metric dimension of convex polytopes generated by the wheel related graphs. Acta Math. Hung. 149, 10\u201330 (2016)","journal-title":"Acta Math. Hung."},{"key":"1225_CR18","first-page":"263","volume":"80","author":"I Javaid","year":"2009","unstructured":"Javaid, I., Salman, M., Chaudhry, M.A., Shokat, S.: Fault-tolerance in resolvibility. Utilitas Math. 80, 263\u2013275 (2009)","journal-title":"Utilitas Math."},{"key":"1225_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Appl. Math. 70, 217\u2013229 (1996)","journal-title":"Discrete Appl. Math."},{"key":"1225_CR20","doi-asserted-by":"crossref","first-page":"9790","DOI":"10.1016\/j.amc.2012.03.047","volume":"218","author":"J Kratica","year":"2012","unstructured":"Kratica, J., Kova\u010devi\u0107-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M., Stojanovi\u0107, M.: Minimal doubly resolving sets and the strong metric dimension of some convex polytopes. Appl. Math. Comput. 218, 9790\u20139801 (2012)","journal-title":"Appl. Math. Comput."},{"key":"1225_CR21","doi-asserted-by":"publisher","first-page":"599","DOI":"10.4236\/am.2016.77055","volume":"7","author":"S Krishnan","year":"2016","unstructured":"Krishnan, S., Rajan, B.: Fault-tolerant resolvability of certain crystal structures. Appl. Math. 7, 599\u2013604 (2016)","journal-title":"Appl. Math."},{"key":"1225_CR22","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/0097-8493(84)90038-4","volume":"8","author":"LN Lester","year":"1984","unstructured":"Lester, L.N., Sandor, J.: Computer graphics on hexagonal grid. Comput. Graph. 8, 401\u2013409 (1984)","journal-title":"Comput. Graph."},{"key":"1225_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2006","author":"K Liu","year":"2006","unstructured":"Liu, K., Abu-Ghazaleh, N.: Virtual coordinate back tracking for void travarsal in geographic routing. In: Kunz, T., Ravi, S.S. (eds.) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2006. Lecture Notes in Computer Science, vol. 4104. Springer, Berlin (2006)"},{"key":"1225_CR24","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jda.2006.09.002","volume":"6","author":"P Manuel","year":"2008","unstructured":"Manuel, P., Rajan, B., Rajasingh, I., Monica, C.: On minimum metric dimension of honeycomb networks. J. Discrete Algorithms 6, 20\u201327 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"1225_CR25","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/TPDS.2002.1036069","volume":"13","author":"FG Nocetti","year":"2002","unstructured":"Nocetti, F.G., Stojmenovic, I., Zhang, J.: Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks. IEEE Trans. Parallel Distrib. Syst. 13, 963\u2013971 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1225_CR26","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/71.899940","volume":"12","author":"B Parhami","year":"2001","unstructured":"Parhami, B., Kwai, D.-M.: A unified formulation of honeycomb and diamond networks. IEEE Trans. Parallel Distrib. Syst. 12, 74\u201379 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1225_CR27","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.amc.2018.07.010","volume":"339","author":"H Raza","year":"2018","unstructured":"Raza, H., Hayat, S., Pan, X.-F.: On the fault-tolerant metric dimension of convex polytopes. Appl. Math. Comput. 339, 172\u2013185 (2018)","journal-title":"Appl. Math. Comput."},{"key":"1225_CR28","unstructured":"Salman, M., Javaid, I., Chaudhry, M.A.: Minimum fault-tolerant, local and strong metric dimension of graphs, arXiv preprint arXiv:1409.2695 (2014), http:\/\/arxiv.org\/pdf\/1409.2695"},{"key":"1225_CR29","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/j.amc.2014.06.006","volume":"242","author":"HMA Siddiqui","year":"2014","unstructured":"Siddiqui, H.M.A., Imran, M.: Computing the metric dimension of wheel related graphs. Appl. Math. Comput. 242, 624\u2013632 (2014)","journal-title":"Appl. Math. Comput."},{"key":"1225_CR30","unstructured":"Slater, P.J.: Leaves of trees. In: Proceedings of 6th Southeastern Conference on Combinatorics, Graph Theory, and Computing. Congr. Numer. 549\u2013559 (1975)"},{"key":"1225_CR31","unstructured":"Stojmenovic I.: Direct interconnection networks. In: Zomaya, A.Y. (ed.) Parallel and Distributed Computing Handbook, McGraw-Hill Professional, pp. 537\u2013567 (1996)"},{"key":"1225_CR32","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/71.629486","volume":"8","author":"I Stojmenovic","year":"1997","unstructured":"Stojmenovic, I.: Honeycomb networks: topological properties and communication algorithms. IEEE Trans. Parallel Distrib. Syst. 8, 1036\u20131042 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"1225_CR33","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1080\/00207160.2015.1109081","volume":"94","author":"T Vetr\u00edk","year":"2015","unstructured":"Vetr\u00edk, T., Ahmad, A.: Computing the metric dimension of the categorial product of some graphs. Int. J. Comput. Math. 94(2), 363\u2013371 (2015)","journal-title":"Int. J. Comput. Math."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-018-01225-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12190-018-01225-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-018-01225-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T16:51:16Z","timestamp":1662483076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12190-018-01225-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,21]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1225"],"URL":"https:\/\/doi.org\/10.1007\/s12190-018-01225-y","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,21]]},"assertion":[{"value":"11 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}