{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:16:41Z","timestamp":1778901401390,"version":"3.51.4"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1016\/j.comnet.2025.111517","type":"journal-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T11:59:57Z","timestamp":1751975997000},"page":"111517","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Fault-tolerant topological indices of graph joins with applications in multi-swarm drone networks"],"prefix":"10.1016","volume":"270","author":[{"given":"Ghulam","family":"Haidar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0055-9077","authenticated-orcid":false,"given":"Murad ul Islam","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sikander","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wali","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"549\u2013559","key":"10.1016\/j.comnet.2025.111517_b1","first-page":"37","article-title":"Leaves of trees","volume":"14","author":"Slater","year":"1975","journal-title":"Congr. Numer."},{"issue":"4","key":"10.1016\/j.comnet.2025.111517_b2","first-page":"445","article-title":"Dominating and reference sets in a graph","volume":"22","author":"Slater","year":"1988","journal-title":"J. Math. Phys. Sci."},{"key":"10.1016\/j.comnet.2025.111517_b3","first-page":"191","article-title":"On the metric dimension of a graph","volume":"2","author":"Melter","year":"1976","journal-title":"Ars Combin."},{"key":"10.1016\/j.comnet.2025.111517_b4","first-page":"47","article-title":"The theory and applications of resolvability in graphs","author":"Chartrand","year":"2003","journal-title":"Congr. Numer."},{"issue":"1\u20133","key":"10.1016\/j.comnet.2025.111517_b5","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":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.comnet.2025.111517_b6","doi-asserted-by":"crossref","first-page":"869","DOI":"10.3390\/math11040869","article-title":"Metric dimensions of bicyclic graphs","volume":"11","author":"Khan","year":"2023","journal-title":"Math."},{"key":"10.1016\/j.comnet.2025.111517_b7","series-title":"Metric dimensions of bicyclic graphs with potential applications in supply chain logistics","author":"Wang","year":"2024"},{"key":"10.1016\/j.comnet.2025.111517_b8","first-page":"81","article-title":"Fault-tolerant metric dimension of graphs","volume":"5","author":"Hernando","year":"2008","journal-title":"Convexity Discret. Struct."},{"key":"10.1016\/j.comnet.2025.111517_b9","first-page":"172","article-title":"On the fault-tolerant metric dimension of convex polytopes","volume":"339","author":"Raza","year":"2018","journal-title":"Appl. Math. Comput."},{"issue":"7","key":"10.1016\/j.comnet.2025.111517_b10","doi-asserted-by":"crossref","first-page":"599","DOI":"10.4236\/am.2016.77055","article-title":"Fault-tolerant resolvability of certain crystal structures","volume":"7","author":"Krishnan","year":"2016","journal-title":"Appl. Math."},{"issue":"9","key":"10.1016\/j.comnet.2025.111517_b11","doi-asserted-by":"crossref","first-page":"1920","DOI":"10.3390\/pr12091920","article-title":"Structural analysis of octagonal nanotubes via double edge-resolving partitions","volume":"12","author":"Alali","year":"2024","journal-title":"Process"},{"key":"10.1016\/j.comnet.2025.111517_b12","series-title":"Fault tolerant metric dimensions of leafless cacti graphs with application in supply chain management","author":"Asif","year":"2024"},{"key":"10.1016\/j.comnet.2025.111517_b13","doi-asserted-by":"crossref","first-page":"145435","DOI":"10.1109\/ACCESS.2020.3014883","article-title":"Fault-tolerant metric dimension of interconnection networks","volume":"8","author":"Hayat","year":"2020","journal-title":"IEEE Access"},{"issue":"1","key":"10.1016\/j.comnet.2025.111517_b14","doi-asserted-by":"crossref","first-page":"78","DOI":"10.3390\/math7010078","article-title":"Fault-tolerant resolvability and extremal structures of graphs","volume":"7","author":"Raza","year":"2019","journal-title":"Math."},{"issue":"11","key":"10.1016\/j.comnet.2025.111517_b15","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.3390\/math10111815","article-title":"On resolvability-and domination-related parameters of complete multipartite graphs","volume":"10","author":"Hayat","year":"2022","journal-title":"Math."},{"issue":"2","key":"10.1016\/j.comnet.2025.111517_b16","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/10543409308835060","article-title":"Structure\u2013activity maps for visualizing the graph variables arising in drug design","volume":"3","author":"Johnson","year":"1993","journal-title":"J. Biopharm. Statist."},{"issue":"2","key":"10.1016\/j.comnet.2025.111517_b17","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":"2","key":"10.1016\/j.comnet.2025.111517_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.asej.2021.09.014","article-title":"Resolvability of the starphene structure and applications in electronics","volume":"13","author":"Ahmad","year":"2022","journal-title":"Ain Shams Eng. J."},{"issue":"3","key":"10.1016\/j.comnet.2025.111517_b19","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":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.comnet.2025.111517_b20","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.jda.2006.09.002","article-title":"On minimum metric dimension of honeycomb networks","volume":"6","author":"Manuel","year":"2008","journal-title":"J. Discrete Algorithms"},{"issue":"10","key":"10.1016\/j.comnet.2025.111517_b21","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1080\/00029890.1963.11992174","article-title":"A combinatory detection problem","volume":"70","author":"S\u00f6derberg","year":"1963","journal-title":"Am. Math. Mon."},{"issue":"10","key":"10.1016\/j.comnet.2025.111517_b22","doi-asserted-by":"crossref","first-page":"8830","DOI":"10.1080\/10406638.2022.2156559","article-title":"Fault-tolerant partition resolvability in chemical graphs","volume":"43","author":"Azhar","year":"2023","journal-title":"Polycycl. Aromat. Compd."},{"key":"10.1016\/j.comnet.2025.111517_b23","first-page":"325","article-title":"Mastermind","volume":"3","author":"Chv\u00e1tal","year":"1983","journal-title":"Comb."},{"issue":"2","key":"10.1016\/j.comnet.2025.111517_b24","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.biosystems.2009.10.003","article-title":"Coevolutionary games\u2014a mini review","volume":"99","author":"Perc","year":"2010","journal-title":"BioSyst."},{"key":"10.1016\/j.comnet.2025.111517_b25","first-page":"1","article-title":"Novel resolvability parameter of some well-known graphs and exchange properties with applications","author":"Ali","year":"2024","journal-title":"J. Appl. Math. Comput."},{"issue":"5","key":"10.1016\/j.comnet.2025.111517_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.heliyon.2024.e26992","article-title":"Double edge resolving set and exchange property for nanosheet structure","volume":"10","author":"Koam","year":"2024","journal-title":"Heliyon"},{"key":"10.1016\/j.comnet.2025.111517_b27","first-page":"33","article-title":"On the metric dimension of joins of two graphs","volume":"5","author":"Shahida","year":"2014","journal-title":"Int. J. Sci. Eng. Res."},{"issue":"1","key":"10.1016\/j.comnet.2025.111517_b28","article-title":"Metric dimension of graph join two paths p 2 and p t.","volume":"25","author":"Haryanto","year":"2019","journal-title":"J. Indones. Math. Soc."},{"issue":"3","key":"10.1016\/j.comnet.2025.111517_b29","doi-asserted-by":"crossref","first-page":"708","DOI":"10.3390\/sym15030708","article-title":"Constant time calculation of the metric dimension of the join of path graphs","volume":"15","author":"Zhang","year":"2023","journal-title":"Symmetry"},{"key":"10.1016\/j.comnet.2025.111517_b30","series-title":"Discrete and Computational Geometry, Graphs, and Games: 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers 21","first-page":"43","article-title":"The metric dimension of the join of paths and cycles","author":"Garces","year":"2021"},{"issue":"10","key":"10.1016\/j.comnet.2025.111517_b31","doi-asserted-by":"crossref","DOI":"10.3390\/s18103434","article-title":"A complex network theory-based modeling framework for unmanned aerial vehicle swarms","volume":"18","author":"Wang","year":"2018","journal-title":"Sens."},{"issue":"4","key":"10.1016\/j.comnet.2025.111517_b32","article-title":"Joint user association and power control in uav network: A graph theoretic approach","volume":"13","author":"Alnakhli","year":"2024","journal-title":"Electron."},{"key":"10.1016\/j.comnet.2025.111517_b33","series-title":"Neural Information Processing","first-page":"270","article-title":"Intelligent uav swarm planning based on undirected graph model","author":"Lv","year":"2024"},{"key":"10.1016\/j.comnet.2025.111517_b34","first-page":"1","article-title":"Network analysis of decentralized fault-tolerant uav swarm coordination in critical missions","volume":"12","author":"Chandran","year":"2024","journal-title":"Drone Syst. Appl."},{"key":"10.1016\/j.comnet.2025.111517_b35","series-title":"Proceedings of 2023 7th Chinese Conference on Swarm Intelligence and Cooperative Control","first-page":"33","article-title":"Adaptive fault-tolerant formation control for multiple uavs under unknown actuator faults","author":"Wang","year":"2024"},{"issue":"1","key":"10.1016\/j.comnet.2025.111517_b36","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1186\/s13638-024-02401-4","article-title":"Computational offloading into uav swarm networks: a systematic literature review","volume":"2024","author":"Baktayan","year":"2024","journal-title":"EURASIP J. Wirel. Commun. Netw."}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128625004840?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128625004840?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T11:49:42Z","timestamp":1755085782000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128625004840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":36,"alternative-id":["S1389128625004840"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2025.111517","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fault-tolerant topological indices of graph joins with applications in multi-swarm drone networks","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2025.111517","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"111517"}}