乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:00:58Z","timestamp":1720051258231},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T00:00:00Z","timestamp":1686787200000},"content-version":"vor","delay-in-days":1475,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"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":[[2019,6]]},"DOI":"10.1016\/j.dam.2019.02.004","type":"journal-article","created":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T13:37:19Z","timestamp":1551965839000},"page":"42-55","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Extremal k<\/mml:mi><\/mml:math>-forcing sets in oriented graphs"],"prefix":"10.1016","volume":"262","author":[{"given":"Yair","family":"Caro","sequence":"first","affiliation":[]},{"given":"Randy","family":"Davila","sequence":"additional","affiliation":[]},{"given":"Ryan","family":"Pepper","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/j.dam.2019.02.004_b1","doi-asserted-by":"crossref","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","article-title":"Zero forcing sets and the minimum rank of graphs","volume":"428","year":"2008","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2019.02.004_b2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2014.08.029","article-title":"Upper bounds on the k-forcing number of a graph","volume":"181","author":"Amos","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2019.02.004_b3","doi-asserted-by":"crossref","first-page":"52","DOI":"10.13001\/1081-3810.1686","article-title":"Minimum rank, maximum nullity, and zero forcing number of simple digraphs","volume":"26","author":"Berliner","year":"2013","journal-title":"Electron. J. Linear Algebra"},{"key":"10.1016\/j.dam.2019.02.004_b4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.dam.2017.02.017","article-title":"Zero forcing propagation time on oriented graphs","volume":"224","author":"Berliner","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2019.02.004_b5","series-title":"Modern Graph Theory, Graduate Texts in Mathematics, Vol. 184","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","author":"Bollob\u00e1s","year":"1998"},{"key":"10.1016\/j.dam.2019.02.004_b6","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.99.100501","article-title":"Full control by locally induced relaxation","volume":"99","author":"Burgarth","year":"2007","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"10.1016\/j.dam.2019.02.004_b7","first-page":"2","article-title":"Dynamic approach to k-forcing","volume":"2","author":"Caro","year":"2015","journal-title":"Theory Appl. Graphs"},{"key":"10.1016\/j.dam.2019.02.004_b8","article-title":"Maximum oriented forcing number for complete graphs","author":"Caro","year":"2017","journal-title":"Theory Appl. Graphs"},{"key":"10.1016\/j.dam.2019.02.004_b9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0012-365X(98)00232-5","article-title":"On the out-domination and in-domination numbers of a digraph","volume":"197\u2013198","author":"Chartrand","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2019.02.004_b10","first-page":"57","article-title":"Iteration index of a zero forcing set in a graph","volume":"64","author":"Chilakammari","year":"2012","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/j.dam.2019.02.004_b11","unstructured":"R. Davila, M. Henning, The forcing number of graphs with a given girth, to appear in Quaestiones Mathematicae."},{"issue":"2","key":"10.1016\/j.dam.2019.02.004_b12","first-page":"1","article-title":"Bounds for the zero forcing number of a graph with large girth","volume":"2","author":"Davila","year":"2015","journal-title":"Theory Appl. Graphs"},{"key":"10.1016\/j.dam.2019.02.004_b13","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","article-title":"Irreversible k-threshold processes: Graph-theoretic threshold models of the spread of disease and of opinion","volume":"157","author":"Dreyer\u00a0Jr","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2019.02.004_b14","doi-asserted-by":"crossref","first-page":"4352","DOI":"10.1016\/j.laa.2010.10.015","article-title":"Vertex and edge spread of the zero forcing number, maximum nullity, and minimum rank of a graph","volume":"436","author":"Edholm","year":"2012","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2019.02.004_b15","first-page":"125","article-title":"On the representation of directed graphs as unions of orderings","volume":"9","author":"Erdos","year":"1964","journal-title":"Publ. Math. Inst. Hungar. Acad."},{"key":"10.1016\/j.dam.2019.02.004_b16","first-page":"181","article-title":"Verallgemeinerung eines Graphentheoretischen Satzes von R\u00e9dei","volume":"21","author":"Gallai","year":"1960","journal-title":"Acta Sci. Math."},{"issue":"8","key":"10.1016\/j.dam.2019.02.004_b17","doi-asserted-by":"crossref","first-page":"1961","DOI":"10.1016\/j.laa.2009.05.003","article-title":"Minimum rank problems","volume":"432","author":"Hogben","year":"2010","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"10.1016\/j.dam.2019.02.004_b18","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1016\/j.jctb.2006.01.002","article-title":"Simultaneous well-balanced orientations of graphs","volume":"96","author":"Kiraly","year":"2006","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/j.dam.2019.02.004_b19","first-page":"334","article-title":"Path partitions of almost regular graphs","volume":"64","author":"Magnant","year":"2016","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.dam.2019.02.004_b20","series-title":"Recent Progress in Combinatorics (Proc. Third Waterloo Conf. on Combinatorics, 1968)","first-page":"133","article-title":"Well-balanced orientations of finite graphs and unobtrusive odd-vertex-pairings","author":"Nash-Williams","year":"1968"},{"key":"10.1016\/j.dam.2019.02.004_b21","series-title":"Zero forcing number: Results for computation and comparison with other graph parameters","author":"Row","year":"2011"},{"key":"10.1016\/j.dam.2019.02.004_b22","doi-asserted-by":"crossref","first-page":"4423","DOI":"10.1016\/j.laa.2011.05.012","article-title":"A technique for computing the zero forcing number of a graph with a cut-vertex","volume":"436","author":"Row","year":"2012","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2019.02.004_b23","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Turan","year":"1941","journal-title":"Math Fiz. Lapok"},{"key":"10.1016\/j.dam.2019.02.004_b24","series-title":"Introduction To Graph Theory","author":"West","year":"2001"},{"key":"10.1016\/j.dam.2019.02.004_b25","series-title":"Combinatorial Optimization and Applications","first-page":"61","article-title":"On the zero forcing number of permutation graphs","author":"Yi","year":"2012"},{"key":"10.1016\/j.dam.2019.02.004_b26","doi-asserted-by":"crossref","first-page":"1812","DOI":"10.1016\/j.disc.2006.03.037","article-title":"Power domination in graphs","volume":"306","author":"Zhao","year":"2006","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X1930085X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X1930085X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T23:38:48Z","timestamp":1712360328000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X1930085X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":26,"alternative-id":["S0166218X1930085X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2019.02.004","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2019,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Extremal -forcing sets in oriented graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2019.02.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}