{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:35Z","timestamp":1759638875794,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,9,22]],"date-time":"2016-09-22T00:00:00Z","timestamp":1474502400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00373-016-1736-5","type":"journal-article","created":{"date-parts":[[2016,9,22]],"date-time":"2016-09-22T19:03:09Z","timestamp":1474570989000},"page":"2367-2392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Relationships Between the 2-Metric Dimension and the 2-Adjacency Dimension in the Lexicographic Product of Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"A.","family":"Estrada-Moreno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1619-1572","authenticated-orcid":false,"given":"I. G.","family":"Yero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A.","family":"Rodr\u00edguez-Vel\u00e1zquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"1736_CR1","volume-title":"Theory and Applications of Distance Geometry","author":"LM Blumenthal","year":"1953","unstructured":"Blumenthal, L.M.: Theory and Applications of Distance Geometry. Oxford University Press, Oxford (1953)"},{"issue":"1","key":"1736_CR2","doi-asserted-by":"crossref","first-page":"102","DOI":"10.2298\/AADM151109022E","volume":"10","author":"A Estrada-Moreno","year":"2016","unstructured":"Estrada-Moreno, A., Ram\u00edrez-Cruz, Y., Rodr\u00edguez-Vel\u00e1zquez, J.A.: On the adjacency dimension of graphs. Appl. Anal. Discrete Math. 10(1), 102\u2013127 (2016)","journal-title":"Appl. Anal. Discrete Math."},{"issue":"6","key":"1736_CR3","first-page":"2829","volume":"9","author":"A Estrada-Moreno","year":"2015","unstructured":"Estrada-Moreno, A., Rodr\u00edguez-Vel\u00e1zquez, J.A., Yero, I.G.: The $$k$$ k -metric dimension of a graph. Appl. Math. Inf. Sci. 9(6), 2829\u20132840 (2015)","journal-title":"Appl. Math. Inf. Sci."},{"issue":"1","key":"1736_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s40840-015-0282-2","volume":"39","author":"A Estrada-Moreno","year":"2016","unstructured":"Estrada-Moreno, A., Yero, I.G., Rodr\u00edguez-Vel\u00e1zquez, J.A.: The $$k$$ k -metric dimension of corona product graphs. Bull. Malays. Math. Sci. Soc. 39(1), 135\u2013156 (2016)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"7","key":"1736_CR5","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1016\/j.disc.2015.12.024","volume":"339","author":"A Estrada-Moreno","year":"2016","unstructured":"Estrada-Moreno, A., Yero, I.G., Rodr\u00edguez-Vel\u00e1zquez, J.A.: The $$k$$ k -metric dimension of the lexicographic product of graphs. Discrete Math. 339(7), 1924\u20131934 (2016)","journal-title":"Discrete Math."},{"key":"1736_CR6","unstructured":"Fernau, H., Rodr\u00edguez-Vel\u00e1zquez, J.A.: On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results. arXiv:1309.2275 [math.CO]"},{"key":"1736_CR7","doi-asserted-by":"crossref","unstructured":"Fernau, H., Rodr\u00edguez-Vel\u00e1zquez, J.A.: Notions of metric dimension of corona products: Combinatorial and computational results, In: Computer Science\u2014Theory and Applications, vol. 8476 of Lecture Notes in Computer Science, pp. 153\u2013166. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-06686-8_12"},{"key":"1736_CR8","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs, Discrete Mathematics and its Applications","author":"R Hammack","year":"2011","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of Product Graphs, Discrete Mathematics and its Applications, 2nd edn. CRC Press, Boca Raton, FL (2011)","edition":"2"},{"key":"1736_CR9","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Comb. 2, 191\u2013195 (1976)","journal-title":"Ars Comb."},{"key":"1736_CR10","unstructured":"Hernando, C., Mora, M., Slater, P.J., Wood, D.R.: Fault-tolerant metric dimension of graphs, In: Changat, M., Klavzar, S., Mulder, H.M., Vijayakumar, A. (eds.), Convexity in Discrete Structures, no.\u00a05 in RMS Lecture Notes Series, pp. 81\u201385. Ramanujan Mathematical Society Ed. (2008)"},{"issue":"22","key":"1736_CR11","doi-asserted-by":"crossref","first-page":"3349","DOI":"10.1016\/j.disc.2012.07.025","volume":"312","author":"M Jannesari","year":"2012","unstructured":"Jannesari, M., Omoomi, B.: The metric dimension of the lexicographic product of graphs. Discrete Math. 312(22), 3349\u20133356 (2012)","journal-title":"Discrete Math."},{"issue":"3","key":"1736_CR12","doi-asserted-by":"crossref","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.: Landmarks in graphs. Discrete Appl. Math. 70(3), 217\u2013229 (1996)","journal-title":"Discrete Appl. Math."},{"key":"1736_CR13","first-page":"549","volume":"14","author":"PJ Slater","year":"1975","unstructured":"Slater, P.J.: Leaves of trees. Congr. Numerantium 14, 549\u2013559 (1975)","journal-title":"Congr. Numerantium"},{"key":"1736_CR14","unstructured":"Yero, I.G., Estrada-Moreno, A., Rodr\u00edguez-Vel\u00e1zquez, J.A.: Computing the $$k$$ k -metric dimension of graphs. arXiv:1401.0342 [math.CO]"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1736-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1736-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1736-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T18:40:29Z","timestamp":1568400029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1736-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,22]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1736"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1736-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2016,9,22]]}}}