{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T15:53:48Z","timestamp":1773935628676,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:00:00Z","timestamp":1712361600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:00:00Z","timestamp":1712361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s11227-024-06053-5","type":"journal-article","created":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T06:01:46Z","timestamp":1712383306000},"page":"15783-15798","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Fault-tolerant basis of generalized fat trees and perfect binary tree derived architectures"],"prefix":"10.1007","volume":"80","author":[{"given":"S.","family":"Prabhu","sequence":"first","affiliation":[]},{"given":"V.","family":"Manimozhi","sequence":"additional","affiliation":[]},{"given":"Akbar","family":"Davoodi","sequence":"additional","affiliation":[]},{"given":"Juan Luis Garc\u00eda","family":"Guirao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,6]]},"reference":[{"issue":"12","key":"6053_CR1","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z Beerliova","year":"2006","unstructured":"Beerliova Z, Eberhard F, Erlebach T, Hall A, Hoffman M, Mihal\u00e1k M (2006) Network discovery and verification. IEEE J Sel Areas Commun 24(12):2168\u20132181","journal-title":"IEEE J Sel Areas Commun"},{"issue":"3","key":"6053_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S Khuller","year":"1996","unstructured":"Khuller S, Ragavachari B, Rosenfield A (1996) Landmarks in graphs. Discret Appl Math 70(3):217\u2013229","journal-title":"Discret Appl Math"},{"key":"6053_CR3","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary F, Melter RA (1976) On the metric dimension of a graph. Ars Combin 2:191\u2013195","journal-title":"Ars Combin"},{"key":"6053_CR4","first-page":"549","volume":"14","author":"PJ Slater","year":"1975","unstructured":"Slater PJ (1975) Leaves of trees. Congr Numer 14:549\u2013559","journal-title":"Congr Numer"},{"issue":"4","key":"6053_CR5","first-page":"445","volume":"22","author":"PJ Slater","year":"1988","unstructured":"Slater PJ (1988) Dominating and reference sets in a graph. J Math Phys Sci 22(4):445\u2013455","journal-title":"J Math Phys Sci"},{"key":"6053_CR6","first-page":"47","volume":"160","author":"G Chartrand","year":"2003","unstructured":"Chartrand G, Zhang P (2003) The theory and applications of resolvability in graphs, a survey. Congr Numer 160:47\u201368","journal-title":"Congr Numer"},{"key":"6053_CR7","first-page":"263","volume":"80","author":"I Javaid","year":"2009","unstructured":"Javaid I, Salman M, Chaudhry MA, Shokat S (2009) Fault-tolerance in resolvability. Utilitas Math 80:263\u2013275","journal-title":"Utilitas Math"},{"key":"6053_CR8","first-page":"333","volume":"138","author":"M Salman","year":"2018","unstructured":"Salman M, Javaid I, Chaudhry MA (2018) Minimum fault-tolerant, local and strong metric dimension of graphs. Ars Combin 138:333\u2013353","journal-title":"Ars Combin"},{"key":"6053_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0166-5316(02)00176-1","volume":"52","author":"WH Wang","year":"2003","unstructured":"Wang WH, Palaniswami M, Low SH (2003) Optimal flow control and routing in multi-path networks. Perform Eval 52:119\u2013132","journal-title":"Perform Eval"},{"key":"6053_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","volume":"105","author":"G Chartrand","year":"2000","unstructured":"Chartrand G, Eroh L, Johnson MA, Oellermann O (2000) Resolvability in graphs and the metric dimension of a graph. Discret Appl Math 105:99\u2013113","journal-title":"Discret Appl Math"},{"issue":"2","key":"6053_CR11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/10543409308835060","volume":"3","author":"M Johnson","year":"1993","unstructured":"Johnson M (1993) Structure-activity maps for visualizing the graph variables arising in drug design. J Biopharm Stat 3(2):203\u2013236","journal-title":"J Biopharm Stat"},{"issue":"1","key":"6053_CR12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.jda.2006.08.003","volume":"6","author":"P Manuel","year":"2008","unstructured":"Manuel P, Abd-El-Barr MI, Rajasingh I, Rajan B (2008) An efficient representation of Benes networks and its applications. J Discrete Alg 6(1):11\u201319","journal-title":"J Discrete Alg"},{"key":"6053_CR13","first-page":"419","volume-title":"European symposium on algorithms","author":"J D\u00edaz","year":"2012","unstructured":"D\u00edaz J, Pottonen O, Serna M, Van Leeuwen EJ (2012) On the complexity of metric dimension. European symposium on algorithms. Springer, Berlin, pp 419\u2013430"},{"key":"6053_CR14","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1007\/s00453-014-9896-2","volume":"72","author":"L Epstein","year":"2015","unstructured":"Epstein L, Levin A, Woeginger GJ (2015) The (weighted) metric dimension of graphs: hard and easy cases. Algorithmica 72:1130\u20131171","journal-title":"Algorithmica"},{"issue":"7","key":"6053_CR15","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1080\/00207160.2013.844335","volume":"91","author":"B Rajan","year":"2014","unstructured":"Rajan B, Rajasingh I, Cynthia JA, Manuel P (2014) Metric dimension of directed graphs. Int J Comput Math 91(7):1397\u20131406","journal-title":"Int J Comput Math"},{"key":"6053_CR16","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1007\/s00453-016-0184-1","volume":"78","author":"F Foucaud","year":"2017","unstructured":"Foucaud F, Mertzios GB, Naserasr R, Parreau A, Valicov P (2017) Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity. Algorithmica 78:914\u2013944","journal-title":"Algorithmica"},{"key":"6053_CR17","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/11814764_6","volume":"4104","author":"K Liu","year":"2006","unstructured":"Liu K, Abu-Ghazaleh N (2006) Virtual coordinates with backtracking for void traversal in geographic routing. Lect Notes Comput Sci 4104:46\u201359","journal-title":"Lect Notes Comput Sci"},{"issue":"10","key":"6053_CR18","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1080\/00029890.1963.11992174","volume":"70","author":"S S\u00f6derberg","year":"1963","unstructured":"S\u00f6derberg S, Shapiro HS (1963) A combinatory detection problem. Am Math Mon 70(10):1066\u20131070","journal-title":"Am Math Mon"},{"issue":"2","key":"6053_CR19","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/moor.1030.0070","volume":"29","author":"A Seb\u0151","year":"2004","unstructured":"Seb\u0151 A, Tannier E (2004) On metric generators of graphs. Math Oper Res 29(2):383\u2013393","journal-title":"Math Oper Res"},{"issue":"3","key":"6053_CR20","doi-asserted-by":"crossref","first-page":"421","DOI":"10.2989\/16073606.2013.779957","volume":"36","author":"S Ahmad","year":"2013","unstructured":"Ahmad S, Chaudhry MA, Javaid I, Salman M (2013) On the metric dimension of generalized Petersen graphs. Quaest Math 36(3):421\u2013435","journal-title":"Quaest Math"},{"key":"6053_CR21","first-page":"5","volume":"67","author":"B Rajan","year":"2008","unstructured":"Rajan B, Rajasingh I, Monica MC, Manuel P (2008) Metric dimension of enhanced hypercube networks. J Comb Math Comb Comput 67:5\u201315","journal-title":"J Comb Math Comb Comput"},{"issue":"1","key":"6053_CR22","doi-asserted-by":"crossref","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 MC (2008) On minimum metric dimension of honeycomb networks. J Discrete Alg 6(1):20\u201327","journal-title":"J Discrete Alg"},{"key":"6053_CR23","first-page":"95","volume":"117","author":"B Rajan","year":"2014","unstructured":"Rajan B, Rajasingh I, Gopal PV, Monica MC (2014) Minimum metric dimension of Illiac networks. Ars Combin 117:95\u2013103","journal-title":"Ars Combin"},{"issue":"2","key":"6053_CR24","doi-asserted-by":"crossref","first-page":"1750027","DOI":"10.1142\/S1793830917500276","volume":"9","author":"A Behtoei","year":"2017","unstructured":"Behtoei A, Davoodi A, Jannesari M, Omoomi B (2017) A characterization of some graphs with metric dimension two. Discrete Math Alg Appl 9(2):1750027","journal-title":"Discrete Math Alg Appl"},{"key":"6053_CR25","first-page":"60","volume":"300","author":"IG Yero","year":"2017","unstructured":"Yero IG, Estrada-Moreno A, Rodr\u00edguez-Vel\u00e1zquez JA (2017) Computing the $$k$$-metric dimension of graphs. Appl Math Comput 300:60\u201369","journal-title":"Appl Math Comput"},{"issue":"5","key":"6053_CR26","doi-asserted-by":"crossref","first-page":"6253","DOI":"10.3233\/JIFS-220218","volume":"43","author":"S Prabhu","year":"2022","unstructured":"Prabhu S, Deepa S, Arulperumjothi M, Susilowati L, Liu JB (2022) Resolving-power domination number of probabilistic neural networks. J Intell Fuzzy Syst 43(5):6253\u20136263","journal-title":"J Intell Fuzzy Syst"},{"issue":"4","key":"6053_CR27","first-page":"1","volume":"52","author":"R Umilasari","year":"2022","unstructured":"Umilasari R, Susilowati L, Slamin, Prabhu S (2022) On the dominant local metric dimension of corona product graphs. IAENG Int J Appl Math 52(4):1\u20137","journal-title":"IAENG Int J Appl Math"},{"key":"6053_CR28","doi-asserted-by":"crossref","first-page":"95","DOI":"10.12688\/f1000research.128866.1","volume":"12","author":"R Alfarisi","year":"2023","unstructured":"Alfarisi R, Susilowati L, Dafik D, Prabhu S (2023) Local multiset dimension of amalgamation graphs. F1000Research 12:95","journal-title":"F1000Research"},{"issue":"4","key":"6053_CR29","doi-asserted-by":"crossref","first-page":"554","DOI":"10.20965\/jaciii.2023.p0554","volume":"27","author":"VJA Cynthia","year":"2023","unstructured":"Cynthia VJA, Ramya M, Prabhu S (2023) Local metric dimension of certain classes of circulant networks. J Adv Comput Intell Intell Informat 27(4):554\u2013560","journal-title":"J Adv Comput Intell Intell Informat"},{"key":"6053_CR30","doi-asserted-by":"publisher","DOI":"10.1080\/09728600.2023.2280799","author":"S Prabhu","year":"2023","unstructured":"Prabhu S, Sagaya Rani Jeba D, Arulperumjothi M, Klav\u017ear S (2023) Metric dimension of irregular convex triangular networks. AKCE Int J Graphs Combin. https:\/\/doi.org\/10.1080\/09728600.2023.2280799","journal-title":"AKCE Int J Graphs Combin"},{"key":"6053_CR31","unstructured":"Hernando C, Mora M, Slater PJ, Wood DR (2008) Fault-tolerant metric dimension of graphs. In: Convexity in discrete structures in Ramanujan mathematical society lecture notes, vol 5, pp 81\u201385"},{"issue":"4","key":"6053_CR32","doi-asserted-by":"crossref","first-page":"495","DOI":"10.5937\/KgJMath1804495S","volume":"42","author":"A Simi\u0107","year":"2018","unstructured":"Simi\u0107 A, Bogdanovi\u0107 M, Maksimovi\u0107 Z, Milo\u0161evi\u0107 J (2018) Fault-tolerant metric dimension problem: a new integer linear programming formulation and exact formula for grid graphs. Kragujevac J Math 42(4):495\u2013503","journal-title":"Kragujevac J Math"},{"key":"6053_CR33","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.tcs.2019.01.011","volume":"817","author":"M Basak","year":"2020","unstructured":"Basak M, Saha L, Das GK, Tiwary K (2020) Fault-tolerant metric dimension of circulant graphs $$C_n(1, 2, 3)$$. Theoret Comput Sci 817:66\u201379","journal-title":"Theoret Comput Sci"},{"issue":"1","key":"6053_CR34","doi-asserted-by":"crossref","first-page":"93","DOI":"10.7494\/OpMath.2022.42.1.93","volume":"42","author":"L Saha","year":"2022","unstructured":"Saha L, Basak M, Tiwary K (2022) All metric bases and fault-tolerant metric dimension for square of grid. Opuscula Math 42(1):93\u2013111","journal-title":"Opuscula Math"},{"key":"6053_CR35","doi-asserted-by":"crossref","first-page":"81527","DOI":"10.1109\/ACCESS.2021.3085584","volume":"2021","author":"ANA Koam","year":"2021","unstructured":"Koam ANA, Ahmad A, Abdelhag ME, Azeem M (2021) Metric and fault-tolerant metric dimension of hollow coronoid. IEEE Access 2021:81527\u201381534","journal-title":"IEEE Access"},{"key":"6053_CR36","doi-asserted-by":"crossref","first-page":"9939559","DOI":"10.1155\/2021\/9939559","volume":"2021","author":"H Wang","year":"2021","unstructured":"Wang H, Azeem M, Nadeem MF, Ur-Rehman A, Aslam A (2021) On fault-tolerant resolving sets of some families of ladder networks. Complexity 2021:9939559","journal-title":"Complexity"},{"key":"6053_CR37","first-page":"172","volume":"339","author":"H Raza","year":"2018","unstructured":"Raza H, Hayat S, Pan XF (2018) On the fault-tolerant metric dimension of convex polytopes. Appl Math Comput 339:172\u2013185","journal-title":"Appl Math Comput"},{"key":"6053_CR38","volume":"420","author":"S Prabhu","year":"2022","unstructured":"Prabhu S, Manimozhi V, Arulperumjothi M, Klav\u017ear S (2022) Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks. Appl Math Comput 420:126897","journal-title":"Appl Math Comput"},{"key":"6053_CR39","doi-asserted-by":"crossref","first-page":"145435","DOI":"10.1109\/ACCESS.2020.3014883","volume":"8","author":"S Hayat","year":"2020","unstructured":"Hayat S, Khan A, Malik MYH, Imran M, Siddiqui MK (2020) Fault-tolerant metric dimension of interconnection networks. IEEE Access 8:145435\u2013145445","journal-title":"IEEE Access"},{"key":"6053_CR40","volume":"452","author":"M Arulperumjothi","year":"2023","unstructured":"Arulperumjothi M, Klav\u017ear S, Prabhu S (2023) Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension. Appl Math Comput 452:128037","journal-title":"Appl Math Comput"},{"key":"6053_CR41","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1016\/j.comnet.2009.02.013","volume":"53","author":"D L\u00fcdtke","year":"2009","unstructured":"L\u00fcdtke D, Tutsch D (2009) The modeling power of CINSim: performance evaluation of interconnection networks. Comput Netw 53:1274\u20131288","journal-title":"Comput Netw"},{"issue":"7","key":"6053_CR42","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y Saad","year":"1988","unstructured":"Saad Y, Schultz MH (1988) Topological properties of hypercubes. IEEE Trans Comput 37(7):867\u2013872","journal-title":"IEEE Trans Comput"},{"issue":"11","key":"6053_CR43","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1109\/TC.1986.1676698","volume":"35","author":"TF Chan","year":"1986","unstructured":"Chan TF, Saad Y (1986) Multigrid algorithms on the hypercube multiprocessor. IEEE Trans Comput 35(11):969\u2013977","journal-title":"IEEE Trans Comput"},{"issue":"12","key":"6053_CR44","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1109\/TC.1987.5009497","volume":"36","author":"K Hwang","year":"1987","unstructured":"Hwang K, Ghosh J (1987) Hypernet: a communication-efficient architecture for constructing massively parallel computers. IEEE Trans Comput 36(12):1450\u20131466","journal-title":"IEEE Trans Comput"},{"key":"6053_CR45","volume-title":"Topological structures and analysis of interconnection networks","author":"J Xu","year":"2013","unstructured":"Xu J (2013) Topological structures and analysis of interconnection networks, vol 7. Springer, Berlin"},{"key":"6053_CR46","doi-asserted-by":"crossref","unstructured":"Ohring SR, Ibel M, Das SK, Kumar MJ (1995) On generalized fat trees. In: Proceedings of 9th International Parallel Processing Symposium, pp 37\u201344","DOI":"10.1109\/IPPS.1995.395911"},{"issue":"10","key":"6053_CR47","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"34","author":"CE Leiserson","year":"1985","unstructured":"Leiserson CE (1985) Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans Comput 34(10):892\u2013901","journal-title":"IEEE Trans Comput"},{"key":"6053_CR48","doi-asserted-by":"crossref","unstructured":"Frank S, Burkhardt H, Rothnie J (1993) The KSR 1: bridging the gap between shared memory and MPPs. Digest of Papers. Compcon Spring, pp 285\u2013294","DOI":"10.1109\/CMPCON.1993.289682"},{"key":"6053_CR49","doi-asserted-by":"crossref","unstructured":"Bay P, Bilardi G (1990) Deterministic on-line routing on area-universal networks. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp 297\u2013306","DOI":"10.1109\/FSCS.1990.89548"},{"key":"6053_CR50","first-page":"345","volume":"5","author":"RI Greenberg","year":"1989","unstructured":"Greenberg RI, Leiserson CE (1989) Randomized routing on fat trees. JAI Press 5:345\u2013374","journal-title":"JAI Press"},{"issue":"6","key":"6053_CR51","doi-asserted-by":"crossref","first-page":"6421","DOI":"10.3233\/JIFS-181314","volume":"35","author":"S Prabhu","year":"2018","unstructured":"Prabhu S, Flora T, Arulperumjothi M (2018) On independent resolving number of TiO$$_2 [m, n]$$ nanotubes. J Intell Fuzzy Syst 35(6):6421\u20136425","journal-title":"J Intell Fuzzy Syst"},{"key":"6053_CR52","first-page":"233","volume":"92","author":"B Rajan","year":"2015","unstructured":"Rajan B, William A, Prabhu S (2015) On certain resolving parameters of tree derived architectures. J Comb Math Comb Comput 92:233\u2013242","journal-title":"J Comb Math Comb Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06053-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06053-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06053-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T20:33:20Z","timestamp":1731702800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06053-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,6]]},"references-count":52,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["6053"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06053-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,6]]},"assertion":[{"value":"8 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}