{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T12:35:01Z","timestamp":1774874101249,"version":"3.50.1"},"reference-count":59,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:00:00Z","timestamp":1772841600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100009708","name":"Novo Nordisk Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009708","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.jpdc.2026.105254","type":"journal-article","created":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T15:42:53Z","timestamp":1772984573000},"page":"105254","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Optimal landmark placement in cluster-based networks"],"prefix":"10.1016","volume":"212","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6403-5091","authenticated-orcid":false,"given":"Akbar","family":"Davoodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4178-6973","authenticated-orcid":false,"given":"Mohsen","family":"Jannesari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.jpdc.2026.105254_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.asej.2025.103922","article-title":"Fault-tolerant basis and fault-tolerant edge basis of three classes of French windmill graphs","volume":"17","author":"Prabhu","year":"2026","journal-title":"Ain Shams Eng. J."},{"key":"10.1016\/j.jpdc.2026.105254_bib0002","first-page":"215","article-title":"On a problem of graph theory","volume":"1","author":"Erd\u0151s","year":"1966","journal-title":"Studia Sci. Math. Hungarica"},{"key":"10.1016\/j.jpdc.2026.105254_bib0003","series-title":"2025 International Conference on Advances in Modern Age Technologies for Health and Engineering Science (AMATHE)","first-page":"1","article-title":"Minimum metric dimension of generalized friendship graphs for patient care monitoring","author":"Angel","year":"2025"},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0004","first-page":"191","article-title":"On the metric dimension of a graph","volume":"2","author":"Harary","year":"1976","journal-title":"Ars combin"},{"issue":"3","key":"10.1016\/j.jpdc.2026.105254_bib0005","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","article-title":"Landmarks in graphs","volume":"70","author":"Khuller","year":"1996","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0006","doi-asserted-by":"crossref","first-page":"3","DOI":"10.20965\/jaciii.2020.p0003","article-title":"Metric dimension of generalized m\u00f6bius ladder and its application to WSN localization","volume":"24","author":"Idrees","year":"2020","journal-title":"J. Adv. Comput. Intell. Intell. Inform."},{"issue":"3","key":"10.1016\/j.jpdc.2026.105254_bib0007","first-page":"384","article-title":"A resolving set based algorithm for fault identification in wireless mesh networks","volume":"21","author":"Wang","year":"2015","journal-title":"J. Univers. Comput. Sci."},{"key":"10.1016\/j.jpdc.2026.105254_bib0008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1756-0381-4-10","article-title":"Using graph theory to analyze biological networks","volume":"4","author":"Pavlopoulos","year":"2011","journal-title":"BioData Min."},{"key":"10.1016\/j.jpdc.2026.105254_bib0009","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"10.1016\/j.jpdc.2026.105254_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.bspc.2024.107362","article-title":"Response prediction of antidepressants: using graph theory tools for brain network connectivity analysis","volume":"103","author":"Davoodi","year":"2025","journal-title":"Biomed. Signal Process. Control"},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0011","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ijpe.2009.10.007","article-title":"Assessing the vulnerability of supply chains using graph theory","volume":"126","author":"Wagner","year":"2010","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.jpdc.2026.105254_bib0012","series-title":"Social Network Analysis: Methods and Applications","author":"Wasserman","year":"1994"},{"key":"10.1016\/j.jpdc.2026.105254_bib0013","first-page":"37","article-title":"Leaves of trees","volume":"14","author":"Peter","year":"1975","journal-title":"Congr. Numer."},{"issue":"1\u20132","key":"10.1016\/j.jpdc.2026.105254_bib0014","first-page":"229","article-title":"On two problems of information theory","volume":"8","author":"Erd\u0151s","year":"1963","journal-title":"A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"},{"issue":"2","key":"10.1016\/j.jpdc.2026.105254_bib0015","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/moor.1030.0070","article-title":"On metric generators of graphs","volume":"29","author":"Seb\u0151","year":"2004","journal-title":"Math. Oper. Res."},{"issue":"12","key":"10.1016\/j.jpdc.2026.105254_bib0016","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","article-title":"Network discovery and verification","volume":"24","author":"Beerliova","year":"2006","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"10.1016\/j.jpdc.2026.105254_bib0017","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/050641867","article-title":"On the metric dimension of Cartesian products of graphs","volume":"21","author":"C\u00e1ceres","year":"2007","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0018","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0734-189X(84)90051-3","article-title":"Metric bases in digital geometry","volume":"25","author":"Robert","year":"1984","journal-title":"Comput.Gr.Image Process."},{"issue":"2","key":"10.1016\/j.jpdc.2026.105254_bib0019","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/10543409308835060","article-title":"Structure-activity maps for visualizing the graph variables arising in drug design","volume":"3","author":"Johnson","year":"1993","journal-title":"J. Biopharm. Stat."},{"issue":"2","key":"10.1016\/j.jpdc.2026.105254_bib0020","doi-asserted-by":"crossref","first-page":"341","DOI":"10.7151\/dmgt.2087","article-title":"Error-correcting codes from k-resolving sets","volume":"39","author":"Robert","year":"2019","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.jpdc.2026.105254_bib0021","series-title":"Algorithms - ESA 2012","first-page":"419","article-title":"On the complexity of metric dimension","author":"D\u00edaz","year":"2012"},{"issue":"4","key":"10.1016\/j.jpdc.2026.105254_bib0022","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1007\/s00453-014-9896-2","article-title":"The (weighted) metric dimension of graphs: hard and easy cases","volume":"72","author":"Epstein","year":"2015","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0023","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","article-title":"Resolvability in graphs and the metric dimension of a graph","volume":"105","author":"Chartrand","year":"2000","journal-title":"Discret. Appl. Math."},{"issue":"02","key":"10.1016\/j.jpdc.2026.105254_bib0024","doi-asserted-by":"crossref","DOI":"10.1142\/S1793830917500276","article-title":"A characterization of some graphs with metric dimension two","volume":"09","author":"Behtoei","year":"2017","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"11","key":"10.1016\/j.jpdc.2026.105254_bib0025","doi-asserted-by":"crossref","first-page":"15783","DOI":"10.1007\/s11227-024-06053-5","article-title":"Fault-tolerant basis of generalized fat trees and perfect binary tree derived architectures","volume":"80","author":"Prabhu","year":"2024","journal-title":"J. Supercomput."},{"issue":"12","key":"10.1016\/j.jpdc.2026.105254_bib0026","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0898-1221(00)00126-7","article-title":"Resolvability and the upper dimension of graphs","volume":"39","author":"Chartrand","year":"2000","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.jpdc.2026.105254_bib0027","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.endm.2005.06.023","article-title":"On the metric dimension of some families of graphs","volume":"22","author":"Hernando","year":"2005","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"10.1016\/j.jpdc.2026.105254_bib0028","first-page":"217","article-title":"Metric dimension of wheels","volume":"8","author":"Shanmukha","year":"2002","journal-title":"Far East J. Appl. Math."},{"key":"10.1016\/j.jpdc.2026.105254_bib0029","series-title":"Metric dimension of Villarceau grids","author":"Prabhu","year":"2024"},{"key":"10.1016\/j.jpdc.2026.105254_bib0030","article-title":"Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension","volume":"452","author":"Arulperumjothi","year":"2023","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0031","first-page":"21","article-title":"Families of regular graphs with constant metric dimension","volume":"75","author":"Javaid","year":"2008","journal-title":"Util. Math."},{"issue":"3","key":"10.1016\/j.jpdc.2026.105254_bib0032","doi-asserted-by":"crossref","first-page":"421","DOI":"10.2989\/16073606.2013.779957","article-title":"On the metric dimension of generalized Petersen graphs","volume":"36","author":"Ahmad","year":"2013","journal-title":"Quaest. Math."},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0033","first-page":"1","article-title":"Low-dimensional representation of genomic sequences","volume":"79","author":"Richard","year":"2019","journal-title":"J. Math. Biol."},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0034","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.disc.2004.09.004","article-title":"Rigidity and separation indices of Paley graphs","volume":"289","author":"Fijav\u017e","year":"2004","journal-title":"Discrete Math"},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0035","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.disc.2005.09.015","article-title":"The metric dimension of Cayley digraphs","volume":"306","author":"Fehr","year":"2006","journal-title":"Discrete Math"},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0036","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-020-76516-1","article-title":"Metric basis and metric dimension of 1-pentagonal carbon nanocone networks","volume":"10","author":"Hussain","year":"2020","journal-title":"Sci Rep."},{"key":"10.1016\/j.jpdc.2026.105254_bib0037","first-page":"47","article-title":"On the metric dimension of circulant and Harary graphs","volume":"248","author":"Grigorious","year":"2014","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"10.1016\/j.jpdc.2026.105254_bib0038","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1016\/j.ejc.2012.10.008","article-title":"Resolving sets for Johnson and Kneser graphs","volume":"34","author":"Bailey","year":"2013","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jpdc.2026.105254_bib0039","doi-asserted-by":"crossref","first-page":"1","DOI":"10.21136\/MB.2014.143632","article-title":"Characterization of n-vertex graphs with metric dimension n-3","volume":"139","author":"Jannesari","year":"2014","journal-title":"Math. Bohem."},{"issue":"10","key":"10.1016\/j.jpdc.2026.105254_bib0040","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1016\/j.aml.2011.03.024","article-title":"On randomly k-dimensional graphs","volume":"24","author":"Jannesari","year":"2011","journal-title":"Appl. Math. Lett."},{"issue":"22","key":"10.1016\/j.jpdc.2026.105254_bib0041","doi-asserted-by":"crossref","first-page":"3349","DOI":"10.1016\/j.disc.2012.07.025","article-title":"The metric dimension of the lexicographic product of graphs","volume":"312","author":"Jannesari","year":"2012","journal-title":"Discrete Math"},{"issue":"9","key":"10.1016\/j.jpdc.2026.105254_bib0042","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1016\/j.disc.2013.01.021","article-title":"The metric dimension of the lexicographic product of graphs","volume":"313","author":"Saputro","year":"2013","journal-title":"Discrete Math"},{"issue":"10","key":"10.1016\/j.jpdc.2026.105254_bib0043","doi-asserted-by":"crossref","DOI":"10.3390\/math6100191","article-title":"On metric dimensions of symmetric graphs obtained by rooted product","volume":"6","author":"Imran","year":"2018","journal-title":"Mathematics"},{"key":"10.1016\/j.jpdc.2026.105254_bib0044","first-page":"139","article-title":"The metric dimension of graph with pendant edges","volume":"65","author":"Iswadi","year":"2008","journal-title":"JCMCC"},{"key":"10.1016\/j.jpdc.2026.105254_bib0045","series-title":"Corrections to the article \u201cThe metric dimension of graph with pendant edges\u201d","author":"Kuziak","year":"2008"},{"issue":"9","key":"10.1016\/j.jpdc.2026.105254_bib0046","doi-asserted-by":"crossref","first-page":"2793","DOI":"10.1016\/j.camwa.2011.03.046","article-title":"On the metric dimension of corona product graphs","volume":"61","author":"Yero","year":"2011","journal-title":"Comput. Appl. Math."},{"issue":"2","key":"10.1016\/j.jpdc.2026.105254_bib0047","doi-asserted-by":"crossref","first-page":"261","DOI":"10.37193\/CJM.2015.02.15","article-title":"The metric dimension of strong product graphs","volume":"31","author":"Rodr\u00edguez-Vel\u00e1zquez","year":"2015","journal-title":"Carpathian J. Math."},{"issue":"1","key":"10.1016\/j.jpdc.2026.105254_bib0048","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s00025-016-0563-6","article-title":"Resolvability and strong resolvability in the direct product of graphs","volume":"71","author":"Kuziak","year":"2017","journal-title":"Results Math"},{"key":"10.1016\/j.jpdc.2026.105254_bib0049","series-title":"Introduction to Graph Theory","volume":"2","author":"West","year":"2001"},{"key":"10.1016\/j.jpdc.2026.105254_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2024.105024","article-title":"Fault-tolerance and unique identification of vertices and edges in a graph: The fault-tolerant mixed metric dimension","volume":"197","author":"Khan","year":"2025","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"10.1016\/j.jpdc.2026.105254_bib0051","doi-asserted-by":"crossref","first-page":"433","DOI":"10.46793\/KgJMat2403.433A","article-title":"Fault-tolerant metric dimension of barycentric subdivision of Cayley graphs","volume":"48","author":"Ahmad","year":"2024","journal-title":"Kragujevac J. Math."},{"issue":"01","key":"10.1016\/j.jpdc.2026.105254_bib0052","article-title":"On fault-tolerant metric dimension of supramolecular networks","volume":"17","author":"Muhammad","year":"2025","journal-title":"Discrete Math. Algorithms Appl."},{"key":"10.1016\/j.jpdc.2026.105254_bib0053","doi-asserted-by":"crossref","first-page":"13","DOI":"10.61091\/jcmcc122-02","article-title":"Fault tolerant metric dimension of arithmetic graphs","volume":"122","author":"Sardar","year":"2024","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"10.1016\/j.jpdc.2026.105254_bib0054","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2025.111517","article-title":"Fault-tolerant topological indices of graph joins with applications in multi-swarm drone networks","volume":"270","author":"Haidar","year":"2025","journal-title":"Comput. Netw."},{"key":"10.1016\/j.jpdc.2026.105254_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2024.105009","article-title":"Fault-tolerance in biswapped multiprocessor interconnection networks","volume":"196","author":"Assiri","year":"2025","journal-title":"J. Parallel Distrib. Comput."},{"issue":"R30","key":"10.1016\/j.jpdc.2026.105254_bib0056","article-title":"Extremal graph theory for metric dimension and diameter","volume":"17","author":"Hernando","year":"2010","journal-title":"Electron. J. Comb."},{"issue":"02","key":"10.1016\/j.jpdc.2026.105254_bib0057","first-page":"117","article-title":"The metric dimension of friendship graph Fn, lollipop graph Lm,n and Petersen graph Pn,m","volume":"8","author":"Mulyono","year":"2016","journal-title":"Politeia"},{"key":"10.1016\/j.jpdc.2026.105254_bib0058","series-title":"Metric dimension of cartesian product of stars","author":"Davoodi","year":"2025"},{"key":"10.1016\/j.jpdc.2026.105254_bib0059","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.dam.2019.09.014","article-title":"On clique coverings of complete multipartite graphs","volume":"276","author":"Davoodi","year":"2020","journal-title":"Discret. Appl. Math."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731526000328?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731526000328?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T11:21:49Z","timestamp":1774869709000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731526000328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":59,"alternative-id":["S0743731526000328"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2026.105254","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal landmark placement in cluster-based networks","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2026.105254","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"105254"}}