{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T10:59:16Z","timestamp":1785149956343,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:00:00Z","timestamp":1781568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:00:00Z","timestamp":1781568000000},"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. Appl. Math. Comput."],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s12190-026-02847-3","type":"journal-article","created":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T12:49:55Z","timestamp":1781614195000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the mixed metric dimension of efficient two-fault-resilient token Ring graphs"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8636-7669","authenticated-orcid":false,"given":"Waqar","family":"Ali","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,16]]},"reference":[{"key":"2847_CR1","unstructured":"Slater, P.J.: Leaves of trees. Proceeding of the 6th southeastern conference on combinatorics, graph theory, and computing, congressus numerantium. 14(549\u2013559), 37 (1975)"},{"issue":"191\u2013195","key":"2847_CR2","first-page":"1","volume":"2","author":"F. Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars. Combinatoria. 2(191\u2013195), 1 (1976)","journal-title":"Ars Combinatoria"},{"issue":"1\u20133","key":"2847_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, M.A., Oellermann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105(1\u20133), 99\u2013113 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(00)00198-0","journal-title":"Discrete Appl. Math."},{"key":"2847_CR4","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., Pelayo, I.M., Puertas, M.L.: On the metric dimension of infinite graphs. Electronic notes in discrete mathematics. Electron. Notes Discrete Math. 35, 15\u201320 (2009). https:\/\/doi.org\/10.1016\/j.endm.2009.11.004","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"2847_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.aml.2011.09.008","volume":"25","author":"M. Imran","year":"2012","unstructured":"Imran, M., Baig, A.Q., Bokhary, S.A.U.H., Javaid, I.: On the metric dimension of circulant graphs. Appl. Math. Lett. 25(3), 320\u2013325 (2012). https:\/\/doi.org\/10.1016\/j.aml.2011.09.008","journal-title":"Appl. Math. Lett."},{"issue":"6","key":"2847_CR6","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1016\/j.dam.2012.10.018","volume":"161","author":"M. Feng","year":"2013","unstructured":"Feng, M., Xu, M., Wang, K.: On the metric dimension of line graphs. Discrete Appl. Math. 161(6), 802\u2013805 (2013). https:\/\/doi.org\/10.1016\/j.dam.2012.10.018","journal-title":"Discrete Appl. Math."},{"key":"2847_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.tcs.2019.02.013","volume":"806","author":"A. Hakanen","year":"2020","unstructured":"Hakanen, A., Junnila, V., Laihonen, T.: The solid-metric dimension. Theor. Comput. Sci. 806, 156\u2013170 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.02.013","journal-title":"Theor Comput Sci."},{"issue":"10","key":"2847_CR8","doi-asserted-by":"publisher","first-page":"2867","DOI":"10.1007\/s00453-020-00707-5","volume":"82","author":"J. Bensmail","year":"2020","unstructured":"Bensmail, J., Mazauric, D., Inerney, F.M., Nisse, N., P\u00e9rennes, S.: Sequential metric dimension. Algorithmica. 82(10), 2867\u20132901 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00707-5","journal-title":"Algorithmica"},{"issue":"1","key":"2847_CR9","doi-asserted-by":"publisher","first-page":"2050095","DOI":"10.1142\/S1793830920500950","volume":"13","author":"S.K. Sharma","year":"2021","unstructured":"Sharma, S.K., Bhat, V.K.: Metric dimension of heptagonal circular ladder. Discrete Math. Algorithm. Appl. 13(1), 2050095 (2021). https:\/\/doi.org\/10.1142\/S1793830920500950","journal-title":"Discrete Math. Algorithm. Appl."},{"key":"2847_CR10","doi-asserted-by":"publisher","unstructured":"Vidya, S., Sharma, S.K., Poojary, P., Bhatta, G.R.V.: Metric basis and metric dimension of some infinite planar graphs. Discrete Math. Algorithm. Appl. 16(8), 2450076 (2024). https:\/\/doi.org\/10.1142\/S1793830924500769","DOI":"10.1142\/S1793830924500769"},{"key":"2847_CR11","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.dam.2018.05.052","volume":"251","author":"A. Kelenc","year":"2018","unstructured":"Kelenc, A., Tratnik, N., Yero, I.G.: Uniquely identifying the edges of a graph: the edge metric dimension. Discrete Appl. Math. 251, 204\u2013220 (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.05.052","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"2847_CR12","doi-asserted-by":"publisher","first-page":"2083","DOI":"10.1016\/j.disc.2018.04.010","volume":"341","author":"N. Zubrilina","year":"2018","unstructured":"Zubrilina, N.: On the edge dimension of a graph. Discrete Math. 341(7), 2083\u20132088 (2018). https:\/\/doi.org\/10.1016\/j.disc.2018.04.010","journal-title":"Discrete Math."},{"issue":"3","key":"2847_CR13","doi-asserted-by":"publisher","first-page":"2465","DOI":"10.1007\/s40840-019-00816-7","volume":"43","author":"I. Peterin","year":"2020","unstructured":"Peterin, I., Yero, I.G.: Edge metric dimension of some graph operations. Bull. Malays. Math. Sci. Soc. 43(3), 2465\u20132477 (2020). https:\/\/doi.org\/10.1007\/s40840-019-00816-7","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"6","key":"2847_CR14","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.: Edge metric dimensions via hierarchical product and integer linear programming. Optim. Lett. 15(6), 1993\u20132003 (2021). https:\/\/doi.org\/10.1007\/s11590-020-01669-x","journal-title":"Optim. Lett."},{"key":"2847_CR15","doi-asserted-by":"publisher","unstructured":"Mhagama, L.S., Husin, M.N., Nadeem, M.F., Ali, W.: Computing the edge metric dimension of the line graph of the molecular graphs of some classes of antiviral drugs, with focus on mpox treatments. Contemp. Math. 1784\u20131802 (2025). https:\/\/doi.org\/10.37256\/cm.6220255898","DOI":"10.37256\/cm.6220255898"},{"key":"2847_CR16","doi-asserted-by":"publisher","unstructured":"Mhagama, L.S., Husin, M.N., Nadeem, M.F., Ali, W.: On the edge metric dimension of some families of splitting graphs. Discrete Math. Algorithm. Appl. p. 2550061 18(04) (2025). https:\/\/doi.org\/10.1142\/S1793830925500612","DOI":"10.1142\/S1793830925500612"},{"issue":"6","key":"2847_CR17","doi-asserted-by":"publisher","first-page":"16422","DOI":"10.3934\/math.2024795","volume":"9","author":"L.S. Mhagama","year":"2024","unstructured":"Mhagama, L.S., Nadeem, M.F., Husin, M.N.: On the edge metric dimension of some classes of cacti. Aims. Math. 9(6), 16422\u201316435 (2024)","journal-title":"Aims Math."},{"key":"2847_CR18","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.amc.2017.07.027","volume":"314","author":"A. Kelenc","year":"2017","unstructured":"Kelenc, A., Kuziak, D., Taranenko, A., Yero, I.G.: Mixed metric dimension of graphs. Appl. Math. Comput. 314, 429\u2013438 (2017). https:\/\/doi.org\/10.1016\/j.amc.2017.07.027","journal-title":"Appl. Math. Comput."},{"key":"2847_CR19","doi-asserted-by":"publisher","first-page":"188146","DOI":"10.1109\/ACCESS.2020.3030713","volume":"8","author":"H. Raza","year":"2020","unstructured":"Raza, H., Ji, Y., Qu, S.: On mixed metric dimension of some path related graphs. IEEE. Access. 8, 188146\u2013188153 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3030713","journal-title":"IEEE. Access"},{"key":"2847_CR20","doi-asserted-by":"publisher","first-page":"11560","DOI":"10.1109\/ACCESS.2019.2961191","volume":"8","author":"H. Raza","year":"2019","unstructured":"Raza, H., Liu, J.B., Qu, S.: On mixed metric dimension of rotationally symmetric graphs. IEEE. Access 8, 11560\u201311569 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2961191","journal-title":"IEEE. Access"},{"key":"2847_CR21","doi-asserted-by":"publisher","unstructured":"Liu, P., Ali, S., Azeem, M., Jamil, M.K., Zahid, M.A., Ali, W., Almohsen, B.: Mixed metric dimension and exchange property of hexagonal nano-network. Sci. Rep. 14(1), 26536 (2024). https:\/\/doi.org\/10.1038\/s41598-024-77697-9","DOI":"10.1038\/s41598-024-77697-9"},{"key":"2847_CR22","doi-asserted-by":"publisher","unstructured":"Sedlar, J., \u0160krekovski, R.: Extremal mixed metric dimension with respect to the cyclomatic number. Appl. Math. Comput. 404, 126238 (2021). https:\/\/doi.org\/10.1016\/j.amc.2021.126238","DOI":"10.1016\/j.amc.2021.126238"},{"key":"2847_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2021.05.004","volume":"300","author":"J. Sedlar","year":"2021","unstructured":"Sedlar, J., \u0160krekovski, R.: Mixed metric dimension of graphs with edge disjoint cycles. Discrete Appl. Math. 300, 1\u20138 (2021). https:\/\/doi.org\/10.1016\/j.dam.2021.05.004","journal-title":"Discrete Appl. Math."},{"issue":"6n07","key":"2847_CR24","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1142\/S0129054122420096","volume":"33","author":"M.F. Nadeem","year":"2022","unstructured":"Nadeem, M.F., Ali, W., Siddiqui, H.M.A.: Locating number of biswapped networks. Int. J. Found. Comput. Sci. 33(6n07), 667\u2013690 (2022). https:\/\/doi.org\/10.1142\/S0129054122420096","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"2847_CR25","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1515\/math-2021-0065","volume":"19","author":"M.M. Danas","year":"2021","unstructured":"Danas, M.M.: The mixed metric dimension of flower snarks and wheels. Open. Math. 19(1), 629\u2013640 (2021). https:\/\/doi.org\/10.1515\/math-2021-0065","journal-title":"Open Math."},{"key":"2847_CR26","doi-asserted-by":"crossref","unstructured":"Darmaji, A. N.: The mixed metric dimension of wheel-like graphs. J. Phys.: Confe. Series. 2157: 012010. IOP Publishing (2022)","DOI":"10.1088\/1742-6596\/2157\/1\/012010"},{"issue":"7","key":"2847_CR27","doi-asserted-by":"publisher","first-page":"102000","DOI":"10.1016\/j.asej.2022.102000","volume":"14","author":"A.N. Koam","year":"2023","unstructured":"Koam, A.N., Ahmad, A., Husain, S., Azeem, M.: Mixed metric dimension of hollow coronoid structure. Ain. Shams. Eng. J. 14(7), 102000 (2023). https:\/\/doi.org\/10.1016\/j.asej.2022.102000","journal-title":"Ain. Shams Eng. J."},{"issue":"2","key":"2847_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/09728600.2023.2291465","volume":"21","author":"M. Korivand","year":"2024","unstructured":"Korivand, M., Khashyarmanesh, K., Tavakoli, M.: Mixed metric dimension over (edge) corona products. AKCE Int. J. Graphs Combinatorics. 21(2), 129\u2013134 (2024). https:\/\/doi.org\/10.1080\/09728600.2023.2291465","journal-title":"AKCE Int. J. Graphs Combinatorics"},{"key":"2847_CR29","doi-asserted-by":"publisher","unstructured":"Sharma, S.K., Bhat, V.K., Azeem, M., Gayathri, M., Almohsen, B.: Computation of mixed resolvability for a circular ladder and its unbounded nature. PLoS one. 20(3), e0313788 (2025). https:\/\/doi.org\/10.1371\/journal.pone.0313788","DOI":"10.1371\/journal.pone.0313788"},{"key":"2847_CR30","doi-asserted-by":"publisher","first-page":"105009","DOI":"10.1016\/j.jpdc.2024.105009","volume":"196","author":"B. Assiri","year":"2025","unstructured":"Assiri, B., Nadeem, M.F., Ali, W., Ahmad, A.: Fault-tolerance in biswapped multiprocessor interconnection networks. J. Parallel Distrib. Comput. 196, 105009 (2025). https:\/\/doi.org\/10.1016\/j.jpdc.2024.105009","journal-title":"J. Parallel Distrib. Comput."},{"key":"2847_CR31","doi-asserted-by":"publisher","unstructured":"Chakraborty, D., Foucaud, F., Hakanen, A.: Distance-based (and path-based) covering problems for graphs of given cyclomatic number. Discrete Math. 348(11), 114595 (2025). https:\/\/doi.org\/10.1016\/j.disc.2025.114595","DOI":"10.1016\/j.disc.2025.114595"},{"key":"2847_CR32","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2025.02.012","volume":"367","author":"H. Hua","year":"2025","unstructured":"Hua, H., Chen, Y., Hua, X.: Further results on the mixed metric dimension of graphs. Discrete Appl. Math. 367, 99\u2013106 (2025). https:\/\/doi.org\/10.1016\/j.dam.2025.02.012","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"2847_CR33","first-page":"381","volume":"16","author":"T.Y. Sung","year":"2000","unstructured":"Sung, T.Y., Ho, T.Y., Chang, C.P., Hsu, L.H.: Optimal k-fault-tolerant networks for token rings. J. Inf. Sci. Eng. 16(3), 381\u2013390 (2000)","journal-title":"J. Inf. Sci. Eng."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02847-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-026-02847-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02847-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T10:02:00Z","timestamp":1785146520000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-026-02847-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,16]]},"references-count":33,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["2847"],"URL":"https:\/\/doi.org\/10.1007\/s12190-026-02847-3","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,16]]},"assertion":[{"value":"5 February 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that there are no conflicts of interest associated with this work.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"188"}}