{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T22:19:55Z","timestamp":1773958795108,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271251"],"award-info":[{"award-number":["12271251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10878-024-01168-0","type":"journal-article","created":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T04:01:21Z","timestamp":1714881681000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The doubly metric dimensions of cactus graphs and block graphs"],"prefix":"10.1007","volume":"47","author":[{"given":"Kairui","family":"Nie","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9376-5226","authenticated-orcid":false,"given":"Kexiang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,5]]},"reference":[{"key":"1168_CR1","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, Pelayo IM, Puertas ML, Seara C, Wood DR (2007) On the metric dimension of Cartesian products of graphs. SIAM J Discrete Math 21:423\u2013441","journal-title":"SIAM J Discrete Math"},{"key":"1168_CR2","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1080\/02331934.2013.772999","volume":"62","author":"M \u010cangalovi\u0107","year":"2013","unstructured":"\u010cangalovi\u0107 M, Kratica J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, Stojanovi\u0107 M (2013) Minimal doubly resolving sets of prism graphs. Optimization 62:1037\u20131043","journal-title":"Optimization"},{"key":"1168_CR3","doi-asserted-by":"publisher","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 OR (2000) Resolvability in graphs and the metric dimension of a graph. Discrete Appl Math 105:99\u2013113","journal-title":"Discrete Appl Math"},{"key":"1168_CR4","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.tcs.2015.03.048","volume":"609","author":"X Chen","year":"2016","unstructured":"Chen X, Hu X, Wang C (2016) Approximation for the minimum cost doubly resolving set problem. Theor Comput Sci 609:526\u2013543","journal-title":"Theor Comput Sci"},{"key":"1168_CR5","first-page":"357","volume":"8591","author":"X Chen","year":"2014","unstructured":"Chen X, Wang C (2014) Approximability of the minimum weighted doubly resolving set problem. Comput Combin Lect Notes Comput Sci 8591:357\u2013368","journal-title":"Comput Combin Lect Notes Comput Sci"},{"key":"1168_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"1168_CR7","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":"1168_CR8","doi-asserted-by":"publisher","first-page":"R30","DOI":"10.37236\/302","volume":"17","author":"C Hernando","year":"2010","unstructured":"Hernando C, Mora M, Pelayo IM, Seara C, Wood DR (2010) Extremal graph theory for metric dimension and diameter. Electron J Combin 17:R30","journal-title":"Electron J Combin"},{"key":"1168_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11590-017-1184-z","volume":"14","author":"A Hertz","year":"2020","unstructured":"Hertz A (2020) An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes. Optim Lett 14:355\u2013367","journal-title":"Optim Lett"},{"key":"1168_CR10","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1007\/s40840-022-01366-1","volume":"45","author":"M Jannesari","year":"2022","unstructured":"Jannesari M (2022) On doubly resolving sets in graphs. Bull Malays Math Sci Soc 45:2041\u20132052","journal-title":"Bull Malays Math Sci Soc"},{"key":"1168_CR11","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.dam.2023.06.017","volume":"339","author":"M Jannesari","year":"2023","unstructured":"Jannesari M (2023) Graphs with doubly resolving number 2. Discrete Appl Math 339:178\u2013183","journal-title":"Discrete Appl Math"},{"key":"1168_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcta.2019.01.002","volume":"165","author":"Z Jiang","year":"2019","unstructured":"Jiang Z, Polyanskii N (2019) On the metric dimension of Cartesian powers of a graph. J Combin Theory Ser A 165:1\u201314","journal-title":"J Combin Theory Ser A"},{"key":"1168_CR13","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 (1996) Landmarks in graphs. Discrete Appl Math 70:217\u2013229","journal-title":"Discrete Appl Math"},{"key":"1168_CR14","volume":"364","author":"S Klav\u017ear","year":"2020","unstructured":"Klav\u017ear S, Tavakoli M (2020) Local metric dimension of graphs: generalized hierarchical products and some applications. Appl Math Comput 364:124676","journal-title":"Appl Math Comput"},{"key":"1168_CR15","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1007\/s11590-020-01669-x","volume":"15","author":"S Klav\u017ear","year":"2021","unstructured":"Klav\u017ear S, Tavakoli M (2021) Edge metric dimensions via hierarchical product and integer linear programming. Optim Lett 15:1993\u20132003","journal-title":"Optim Lett"},{"key":"1168_CR16","doi-asserted-by":"publisher","first-page":"2149","DOI":"10.1016\/j.cor.2008.08.002","volume":"36","author":"J Kratica","year":"2009","unstructured":"Kratica J, \u010cangalovi\u0107 M, Kova\u010devi\u0107-Vuj\u010di\u0107 V (2009) Computing minimal doubly resolving sets of graphs. Comput Oper Res 36:2149\u20132159","journal-title":"Comput Oper Res"},{"key":"1168_CR17","doi-asserted-by":"crossref","unstructured":"Kratica J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M, Stojanovi\u0107 M (2012a) Minimal doubly resolving sets and the strong metric dimension of Hamming graphs. Appl Anal Discrete Math 6:63\u201371","DOI":"10.2298\/AADM111116023K"},{"key":"1168_CR18","doi-asserted-by":"crossref","unstructured":"Kratica J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M, Stojanovi\u0107 M (2012b) Minimal doubly resolving sets and the strong metric dimension of some convex polytopes. Appl Math Comput 218:9790\u20139801","DOI":"10.1016\/j.amc.2012.03.047"},{"key":"1168_CR19","doi-asserted-by":"crossref","unstructured":"Liu J, Zafari A (2020) Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph. Complexity 2020:6267072","DOI":"10.1155\/2020\/6267072"},{"key":"1168_CR20","doi-asserted-by":"crossref","unstructured":"Liu J, Zafari A (2022) Some resolving parameters in a class of Cayley graphs. J Math 2022:9444579","DOI":"10.1155\/2022\/9444579"},{"key":"1168_CR21","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.dam.2021.11.016","volume":"309","author":"C Lu","year":"2022","unstructured":"Lu C, Ye Q (2022) A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem. Discrete Appl Math 309:147\u2013159","journal-title":"Discrete Appl Math"},{"key":"1168_CR22","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1007\/s10878-020-00575-3","volume":"44","author":"C Lu","year":"2022","unstructured":"Lu C, Ye Q, Zhu C (2022) Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs. J Comb Optim 44:2029\u20132039","journal-title":"J Comb Optim"},{"key":"1168_CR23","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.ejor.2012.02.019","volume":"220","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107 N, Kratica J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M (2012) Variable neighborhood search for metric dimension and minimal doubly resolving set problems. Eur J Oper Res 220:328\u2013337","journal-title":"Eur J Oper Res"},{"key":"1168_CR24","doi-asserted-by":"crossref","unstructured":"Nie K, Xu K (2023a) The doubly metric dimension of cylinder graphs and torus graphs. Bull Malays Math Sci Soc 46:24","DOI":"10.1007\/s40840-022-01404-y"},{"key":"1168_CR25","doi-asserted-by":"crossref","unstructured":"Nie K, Xu K (2023b) Mixed metric dimension of some graphs. Appl Math Comput 442:127737","DOI":"10.1016\/j.amc.2022.127737"},{"key":"1168_CR26","doi-asserted-by":"crossref","unstructured":"Nie K, Xu K (2023c) The doubly metric dimension of corona product graphs. Filomat 37:4375\u20134386","DOI":"10.2298\/FIL2313375N"},{"key":"1168_CR27","volume":"396","author":"J Sedlar","year":"2021","unstructured":"Sedlar J, \u0160krekovski R (2021) Bounds on metric dimensions of graphs with edge disjoint cycles. Appl Math Comput 396:125908","journal-title":"Appl Math Comput"},{"key":"1168_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2022.02.022","volume":"314","author":"J Sedlar","year":"2022","unstructured":"Sedlar J, \u0160krekovski R (2022) Vertex and edge metric dimensions of unicyclic graphs. Discrete Appl Math 314:81\u201392","journal-title":"Discrete Appl Math"},{"key":"1168_CR29","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"},{"key":"1168_CR30","doi-asserted-by":"publisher","first-page":"457","DOI":"10.18514\/MMN.2022.1950","volume":"23","author":"S Sultan","year":"2022","unstructured":"Sultan S, Ba\u010da M, Ahmad A, Imran M (2022) Minimal doubly resolving sets of antiprism graphs and M\u00f6bius ladders. Miskolc Math Notes 23:457\u2013469","journal-title":"Miskolc Math Notes"},{"key":"1168_CR31","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10878-021-00838-7","volume":"44","author":"M Wei","year":"2022","unstructured":"Wei M, Yue J, Chen L (2022) The effect of vertices and edge deletion on the edge metric dimension of graphs. J Combin Optim 44:331\u2013342","journal-title":"J Combin Optim"},{"key":"1168_CR32","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/s10878-019-00472-4","volume":"39","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Gao S (2020) On the edge metric dimension of convex polytopes and its related graphs. J Combin Optim 39:334\u2013350","journal-title":"J Combin Optim"},{"key":"1168_CR33","doi-asserted-by":"publisher","first-page":"3539","DOI":"10.3390\/math10193539","volume":"10","author":"E Zhu","year":"2022","unstructured":"Zhu E, Peng S, Liu C (2022) Identifying the exact value of the metric dimension and edge dimension of unicyclic graphs. Mathematics 10:3539","journal-title":"Mathematics"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01168-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01168-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01168-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T13:11:26Z","timestamp":1715951486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01168-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1168"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01168-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"12 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 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 have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"67"}}