{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:22:34Z","timestamp":1777645354401,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2015,11]]},"abstract":"<jats:p>A vertex w of a connected graph G strongly resolves two vertices u, v \u2208 V ( G), if there exists some shortest u \u2013 w path containing v or some shortest v \u2013 w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. In this paper we obtain several tight bounds or closed formulae for the strong metric dimension of the Cartesian sum of graphs in terms of the strong metric dimension, clique number or twins-free clique number of its factor graphs.<\/jats:p>","DOI":"10.3233\/fi-2015-1263","type":"journal-article","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T14:24:13Z","timestamp":1442240653000},"page":"57-69","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Strong Metric Dimension of Cartesian Sum Graphs"],"prefix":"10.1177","volume":"141","author":[{"given":"Dorota","family":"Kuziak","sequence":"first","affiliation":[{"name":"Departament d\u2019Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Av. Pa\u00efsos Catalans 26, 43007 Tarragona, Spain."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ismael G.","family":"Yero","sequence":"additional","affiliation":[{"name":"Departamento de Matem\u00e1ticas, Escuela Polit\u00e9cnica Superior de Algeciras, Universidad de C\u00e1diz, Av. Ram\u00f3n Puyol s\/n, 11202 Algeciras, Spain."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Rodr\u00edguez-Vel\u00e1zquez","sequence":"additional","affiliation":[{"name":"Departament d\u2019Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Universitat Rovira i Virgili, Av. Pa\u00efsos Catalans 26, 43007 Tarragona, Spain."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2015,11,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2015-1263","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2015-1263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:01Z","timestamp":1777444321000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2015-1263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["10.3233\/FI-2015-1263"],"URL":"https:\/\/doi.org\/10.3233\/fi-2015-1263","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11]]}}}