乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T07:24:52Z","timestamp":1726471492431},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"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":[[2023,4]]},"DOI":"10.1016\/j.dam.2023.01.023","type":"journal-article","created":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T12:43:39Z","timestamp":1675255419000},"page":"106-125","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["On redundant locating-dominating sets"],"prefix":"10.1016","volume":"329","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-9549-2324","authenticated-orcid":false,"given":"Devin C.","family":"Jean","sequence":"first","affiliation":[]},{"given":"Suk J.","family":"Seo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/j.dam.2023.01.023_b1","doi-asserted-by":"crossref","first-page":"1674","DOI":"10.1016\/j.dam.2011.04.025","article-title":"Watching systems in graphs: an extension of identifying codes","volume":"161","author":"Auger","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2023.01.023_b2","first-page":"225","article-title":"Characterizations of trees with unique minimum locating-dominating sets","volume":"76","author":"Blidia","year":"2011","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"6","key":"10.1016\/j.dam.2023.01.023_b3","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1007\/s00373-010-0880-6","article-title":"Determining sets, resolving sets, and the exchange property","volume":"25","author":"Boutin","year":"2009","journal-title":"Graphs Combin."},{"issue":"3","key":"10.1016\/j.dam.2023.01.023_b4","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","article-title":"Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard","volume":"290","author":"Charon","year":"2003","journal-title":"Theoret. Comput. Sci."},{"issue":"1987","key":"10.1016\/j.dam.2023.01.023_b5","first-page":"135","article-title":"Locating dominating sets in series parallel networks","volume":"56","author":"Colbourn","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/j.dam.2023.01.023_b6","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.dam.2015.06.038","article-title":"Locating\u2013dominating sets in twin-free graphs","volume":"200","author":"Foucaud","year":"2016","journal-title":"Discrete Appl. Math."},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/j.dam.2023.01.023_b7"},{"key":"10.1016\/j.dam.2023.01.023_b8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejc.2013.04.009","article-title":"Nordhaus\u2013Gaddum bounds for locating domination","volume":"36","author":"Hernando","year":"2014","journal-title":"European J. Combin."},{"article-title":"Fault-tolerant metric dimension of graphs","year":"2008","series-title":"Convexity in Discrete Structures, Vol. 5","author":"Hernando","key":"10.1016\/j.dam.2023.01.023_b9"},{"issue":"22","key":"10.1016\/j.dam.2023.01.023_b10","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.2023.01.023_b11","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.tcs.2022.03.014","article-title":"Extremal cubic graphs for fault-tolerant locating domination","volume":"917","author":"Jean","year":"2022","journal-title":"Theoret. Comput. Sci."},{"year":"2022","series-title":"Fault-tolerant locating-dominating sets on the infinite king grid","author":"Jean","key":"10.1016\/j.dam.2023.01.023_b12"},{"year":"2022","series-title":"Fault-tolerant locating-dominating sets with error-correction","author":"Jean","key":"10.1016\/j.dam.2023.01.023_b13"},{"journal-title":"Discuss. Math. Graph Theory","article-title":"Fault-tolerant identifying codes in special classes of graphs","year":"2023","author":"Jean","key":"10.1016\/j.dam.2023.01.023_b14"},{"issue":"2","key":"10.1016\/j.dam.2023.01.023_b15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.7151\/dmgt.2374","article-title":"Optimal error-detecting open-locating-dominating set on the infinite triangular grid","volume":"43","author":"Jean","year":"2023","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2023.01.023_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.dam.2023.01.023","article-title":"Progress on fault-tolerant locating-dominating sets","author":"Jean","year":"2023","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"2","key":"10.1016\/j.dam.2023.01.023_b17","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","article-title":"On a new class of codes for identifying vertices in graphs","volume":"44","author":"Karpovsky","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"year":"2022","series-title":"Watching systems, identifying, locating-dominating and discriminating codes in graphs","author":"lobstein","key":"10.1016\/j.dam.2023.01.023_b18"},{"key":"10.1016\/j.dam.2023.01.023_b19","first-page":"31","article-title":"Open-locating-dominating sets in the infinite king grid","volume":"104","author":"Seo","year":"2018","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.dam.2023.01.023_b20","first-page":"109","article-title":"Open neighborhood locating dominating sets","volume":"46","author":"Seo","year":"2010","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.dam.2023.01.023_b21","doi-asserted-by":"crossref","first-page":"797","DOI":"10.7151\/dmgt.1838","article-title":"Fault tolerant detectors for distinguishing sets in graphs","volume":"35","author":"Seo","year":"2015","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2023.01.023_b22","first-page":"15","article-title":"Generalized set dominating and separating systems","volume":"104","author":"Seo","year":"2018","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"1","key":"10.1016\/j.dam.2023.01.023_b23","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230170105","article-title":"Domination and location in acyclic graphs","volume":"17","author":"Slater","year":"1987","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.dam.2023.01.023_b24","first-page":"445","article-title":"Dominating and reference sets in a graph","volume":"22","author":"Slater","year":"1988","journal-title":"J. Math. Phys. Sci"},{"issue":"1\u20133","key":"10.1016\/j.dam.2023.01.023_b25","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0012-365X(01)00244-8","article-title":"Fault-tolerant locating-dominating sets","volume":"249","author":"Slater","year":"2002","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X23000276?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X23000276?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T03:40:11Z","timestamp":1677037211000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X23000276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":25,"alternative-id":["S0166218X23000276"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2023.01.023","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2023,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On redundant locating-dominating sets","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2023.01.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}