{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T16:00:24Z","timestamp":1777996824957,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T00:00:00Z","timestamp":1641168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T00:00:00Z","timestamp":1641168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00838-7","type":"journal-article","created":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T12:03:36Z","timestamp":1641211416000},"page":"331-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The effect of vertex and edge deletion on the edge metric dimension of graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Meiqin","family":"Wei","sequence":"first","affiliation":[]},{"given":"Jun","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Lily","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,3]]},"reference":[{"key":"838_CR1","doi-asserted-by":"crossref","unstructured":"Bondy JA, Murty USR (2008) Graph Theory, GTM 244. Springer-Verlag, New York","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"2","key":"838_CR2","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1137\/16M1097833","volume":"32","author":"L Beaudou","year":"2018","unstructured":"Beaudou L, Dankelmann P, Foucadu F, Henning MA, Mary A, Parreau A (2018) Bounding the order of a graph using its diameter and metric dimension: a study through tree decomposions and vc dimension. SIAM J Discrete Math 32(2):902\u2013918","journal-title":"SIAM J Discrete Math"},{"issue":"2","key":"838_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/050641867","volume":"21","author":"J C\u00e1ceres","year":"2007","unstructured":"C\u00e1ceres J, Hernando C, Mora M, Pelayo I, Puertas M, Seara C, Wood D (2007) On the metric dimension of Cartesian product of graphs. SIAM J Discrete Math 21(2):423\u2013441","journal-title":"SIAM J Discrete Math"},{"key":"838_CR4","unstructured":"Chartrand G, Zhang P(2003) The theory and applications of resolvability in graphs. A Survey, Congr Numer, 160:47\u201368"},{"key":"838_CR5","unstructured":"Diestel R (2005) Graph Theory, GTM 173. Springer-Verlag, Heidelberg"},{"issue":"4","key":"838_CR6","first-page":"433","volume":"6","author":"L Eroh","year":"2015","unstructured":"Eroh L, Feit P, Kang C, Yi E (2015) The effect of vertex or edge deletion on the metric dimension of graphs. J Combin 6(4):433\u2013444","journal-title":"J Combin"},{"key":"838_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2020.03.001","volume":"284","author":"J Geneson","year":"2020","unstructured":"Geneson J (2020) Metric dimension and pattern avoidance in graphs. Discrete Appl Math 284:1\u20137","journal-title":"Discrete Appl Math"},{"key":"838_CR8","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary F, Melter R (1976) On the metric dimension of a graph. Ars Combin 2:191\u2013195","journal-title":"Ars Combin"},{"key":"838_CR9","doi-asserted-by":"crossref","unstructured":"Jiang Z, Polyanskii N,(2019) On the metric dimension of Cartesian powers of a graph. J Combin Theory Ser A 165:1\u201314","DOI":"10.1016\/j.jcta.2019.01.002"},{"key":"838_CR10","doi-asserted-by":"crossref","unstructured":"Knor M, Majstorovi\u0107 S, Toshi A, S\u0306krekovski R, Yero I (2021) Graphs with the edge metric dimension smaller than the metric dimension. Appl Math Comput 401:126076","DOI":"10.1016\/j.amc.2021.126076"},{"key":"838_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 IG (2018) Uniquely identifying the edges of a graph: the edge metric dimension. Discrete Appl Math 251:204\u2013220","journal-title":"Discrete Appl Math"},{"key":"838_CR12","unstructured":"Kuziak D, Yero IG, Metric dimension related parameters in graphs: a survey on combinatorial. Comput Appl Res. arXiv:2107.04877"},{"key":"838_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 IG (2020) Edge metric dimension of some graph operations. Bull Malays Math Sci Soc 43:2465\u20132477","journal-title":"Bull Malays Math Sci Soc"},{"key":"838_CR14","first-page":"549","volume":"14","author":"P Slater","year":"1975","unstructured":"Slater P (1975) Leaves of trees proceeding of the 6th southeastern conference on combinatorics, graph theory, and computing. Congr Numer 14:549\u2013559","journal-title":"Congr Numer"},{"key":"838_CR15","unstructured":"Tillquist RC, Frongillo RM, Lladser ME, Getting the lay of the land in discrete space: a survey of metric dimension and its applications. arXiv:2104.07201"},{"issue":"5","key":"838_CR16","doi-asserted-by":"publisher","first-page":"4459","DOI":"10.3934\/math.2020286","volume":"5","author":"M Wei","year":"2020","unstructured":"Wei M, Yue J, Zhu X (2020) On the edge metric dimension of graphs. AIMS Math 5(5):4459\u20134465","journal-title":"AIMS Math"},{"key":"838_CR17","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 (2018) On the edge dimension of a graph. Discrete Math 341:2083\u20132088","journal-title":"Discrete Math"},{"key":"838_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.dam.2018.08.031","volume":"257","author":"E Zhu","year":"2019","unstructured":"Zhu E, Taranenko A, Shao Z, Xu J (2019) On graphs with the maximum edge metric dimension. Discrete Appl Math 257:317\u2013324","journal-title":"Discrete Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00838-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00838-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00838-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:31:04Z","timestamp":1659079864000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00838-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["838"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00838-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,3]]},"assertion":[{"value":"2 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}