{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:54:47Z","timestamp":1781463287430,"version":"3.54.1"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.007","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T12:59:03Z","timestamp":1779454743000},"page":"367-381","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Metric dimension of a direct product of three complete graphs: The middle cone family"],"prefix":"10.1016","volume":"391","author":[{"given":"Briana","family":"Foster-Greenwood","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3523-9412","authenticated-orcid":false,"given":"Christine","family":"Uhl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2026.05.007_b1","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/050641867","article-title":"On the metric dimension of cartesian products of graphs","volume":"21","author":"C\u00e1ceres","year":"2007","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"10.1016\/j.dam.2026.05.007_b2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","article-title":"Resolvability in graphs and the metric dimension of a graph","volume":"105","author":"Chartrand","year":"2000","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.dam.2026.05.007_b3","doi-asserted-by":"crossref","DOI":"10.37236\/12399","article-title":"Metric dimension of a direct product of three complete graphs","volume":"31","author":"Foster-Greenwood","year":"2024","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2026.05.007_b4","series-title":"On the metric dimension of Ka\u00d7Kb\u00d7Kc","author":"Gledel","year":"2024"},{"key":"10.1016\/j.dam.2026.05.007_b5","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.tcs.2019.05.042","article-title":"The metric dimension of Zn\u00d7Zn\u00d7Zn is \u230a3n\/2\u230b","volume":"806","author":"J\u00e4ger","year":"2020","journal-title":"Theoret. Comput. Sci."},{"issue":"22","key":"10.1016\/j.dam.2026.05.007_b6","doi-asserted-by":"crossref","first-page":"3349","DOI":"10.1016\/j.disc.2012.07.025","article-title":"The metric dimension of the lexicographic product of graphs","volume":"312","author":"Jannesari","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.007_b7","series-title":"New optimal results on codes for location in graphs","author":"Junnila","year":"2025"},{"issue":"3","key":"10.1016\/j.dam.2026.05.007_b8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","article-title":"Landmarks in graphs","volume":"70","author":"Khuller","year":"1996","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"10.1016\/j.dam.2026.05.007_b9","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s00025-016-0563-6","article-title":"Resolvability and strong resolvability in the direct product of graphs","volume":"71","author":"Kuziak","year":"2017","journal-title":"Results Math."},{"key":"10.1016\/j.dam.2026.05.007_b10","series-title":"Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results","author":"Kuziak","year":"2021"},{"issue":"1","key":"10.1016\/j.dam.2026.05.007_b11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.26493\/1855-3974.100.7f8","article-title":"Eigenspaces of Hamming graphs and unitary Cayley graphs","volume":"3","author":"Sander","year":"2010","journal-title":"Ars Math. Contemp."},{"key":"10.1016\/j.dam.2026.05.007_b12","series-title":"SageMath, the Sage Mathematics Software System (version 10.6)","author":"The Sage Developers","year":"2022"},{"issue":"4","key":"10.1016\/j.dam.2026.05.007_b13","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1137\/21M1409512","article-title":"Getting the lay of the land in discrete space: A survey of metric dimension and its applications","volume":"65","author":"Tillquist","year":"2023","journal-title":"SIAM Rev."},{"issue":"1","key":"10.1016\/j.dam.2026.05.007_b14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00285-019-01348-1","article-title":"Low-dimensional representation of genomic sequences","volume":"79","author":"Tillquist","year":"2019","journal-title":"J. Math. Biol."},{"issue":"2","key":"10.1016\/j.dam.2026.05.007_b15","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1080\/00207160.2015.1109081","article-title":"Computing the metric dimension of the categorial product of some graphs","volume":"94","author":"Vetr\u00edk","year":"2017","journal-title":"Int. J. Comput. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002908?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002908?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:06:24Z","timestamp":1781460384000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":15,"alternative-id":["S0166218X26002908"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.007","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Metric dimension of a direct product of three complete graphs: The middle cone family","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}