{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:21:57Z","timestamp":1756311717607,"version":"3.41.2"},"reference-count":24,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:p> In this paper, we introduce a variant of strong metric dimension, called the fault-tolerant strong metric dimension. A strong resolving set [Formula: see text] for [Formula: see text] is fault-tolerant if [Formula: see text] is also a strong resolving set, for each [Formula: see text] in [Formula: see text], and the fault-tolerant strong metric dimension of [Formula: see text] is the minimum cardinality of such a set and is denoted by [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830922501622","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T12:10:01Z","timestamp":1663330201000},"source":"Crossref","is-referenced-by-count":1,"title":["Fault-tolerant strong metric dimension of graphs"],"prefix":"10.1142","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3616-7614","authenticated-orcid":false,"given":"Sathish","family":"Krishnan","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science and Humanities, SRM Institute of Science and Technology, Kattankulathur, Kancheepuram 603 203, India"}]},{"given":"Bharati","family":"Rajan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Loyola College, Chennai 600 034, India"}]}],"member":"219","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"S1793830922501622BIB001","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Beerliova Z.","year":"2006","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"S1793830922501622BIB002","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","volume":"105","author":"Chartrand G.","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"S1793830922501622BIB003","first-page":"47","volume":"160","author":"Chartrand G.","year":"2003","journal-title":"Congr. Numer."},{"key":"S1793830922501622BIB004","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02579188","volume":"3","author":"Chv\u00e1tal V.","year":"1983","journal-title":"Combinatorica"},{"issue":"3","key":"S1793830922501622BIB005","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/BF01844162","volume":"4","author":"Frucht M.","year":"1970","journal-title":"Aequationes Math."},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","year":"1979","author":"Garey M. R.","key":"S1793830922501622BIB006"},{"key":"S1793830922501622BIB007","first-page":"47","volume":"248","author":"Grigorious C.","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"S1793830922501622BIB008","first-page":"191","volume":"2","author":"Harary F.","year":"1976","journal-title":"Ars Combin."},{"key":"S1793830922501622BIB009","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.endm.2005.06.023","volume":"22","author":"Hernando C.","year":"2005","journal-title":"Electron. Notes Discrete Math."},{"key":"S1793830922501622BIB010","series-title":"Ramanujan Mathematical Society Lecture Note","first-page":"81","volume-title":"Proc. Int. Conf. Convexity in Discrete Structures","volume":"5","author":"Hernando C.","year":"2008"},{"key":"S1793830922501622BIB011","first-page":"113","volume":"117","author":"Imran M.","year":"2014","journal-title":"Ars Combin."},{"key":"S1793830922501622BIB012","first-page":"263","volume":"80","author":"Javaid I.","year":"2009","journal-title":"Util. Math."},{"key":"S1793830922501622BIB013","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"Khuller S.","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"S1793830922501622BIB014","first-page":"302","volume":"5","author":"Klein D. J.","year":"2012","journal-title":"Eur. J. Appl. Math."},{"key":"S1793830922501622BIB015","first-page":"9790","volume":"19","author":"Kratica J.","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"S1793830922501622BIB016","doi-asserted-by":"crossref","first-page":"599","DOI":"10.4236\/am.2016.77055","volume":"7","author":"Krishnan S.","year":"2016","journal-title":"Appl. Math."},{"key":"S1793830922501622BIB017","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1166\/jctn.2017.6328","volume":"14","author":"Krishnan S.","year":"2017","journal-title":"J. Comput. Theor. Nanosci."},{"issue":"7","key":"S1793830922501622BIB018","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1016\/j.dam.2012.10.009","volume":"161","author":"Kuziak D.","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"S1793830922501622BIB019","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.jda.2006.09.002","volume":"6","author":"Manuel P.","year":"2008","journal-title":"J. Discrete Algorithms"},{"key":"S1793830922501622BIB020","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.dam.2006.06.009","volume":"155","author":"Oellermann O. R.","year":"2007","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"S1793830922501622BIB022","first-page":"637","volume":"101","author":"Sathish K.","year":"2015","journal-title":"Int. J. Pure Appl. Math."},{"issue":"2","key":"S1793830922501622BIB023","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/moor.1030.0070","volume":"29","author":"Seb\u00f6 A.","year":"2004","journal-title":"Math. Oper. Res."},{"key":"S1793830922501622BIB024","first-page":"549","volume-title":"Proc. 6th Southeastern Conf. Combinatorics, Graph Theory, and Computing","volume":"14","author":"Slater P. J.","year":"1975"},{"key":"S1793830922501622BIB025","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1007\/s10114-013-2365-z","volume":"29","author":"Yi E.","year":"2013","journal-title":"Acta Math. Sin. (Engl. Ser.)"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T09:10:00Z","timestamp":1689930600000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":24,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["10.1142\/S1793830922501622"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501622","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,10,17]]},"article-number":"2250162"}}