{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T08:14:07Z","timestamp":1745309647991,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019MA012"],"award-info":[{"award-number":["ZR2019MA012"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10878-023-01089-4","type":"journal-article","created":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T21:41:37Z","timestamp":1700170897000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bounding the total forcing number of graphs"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5345-9953","authenticated-orcid":false,"given":"Shengjin","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengya","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingui","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,16]]},"reference":[{"key":"1089_CR1","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","volume":"428","author":"AIM Minimum Rank C Special Graphs Work Group","year":"2008","unstructured":"AIM Minimum Rank C Special Graphs Work Group (2008) Zero forcing sets and the minimum rank of graphs. Linear Algeb Appl 428:1628\u20131648","journal-title":"Linear Algeb Appl"},{"key":"1089_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2014.08.029","volume":"181","author":"D Amos","year":"2015","unstructured":"Amos D, Caro Y, Davila R, Pepper R (2015) Upper bounds on the k-forcing number of a graph. Discret Appl Math 181:1\u201310","journal-title":"Discret Appl Math"},{"key":"1089_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1002\/jgt.21637","volume":"72","author":"F Barioli","year":"2013","unstructured":"Barioli F, Barrett W, Fallat S, Hall T, Hogben L, Shader B, van den Driessche P, van der Holst H (2013) Parameters related to tree-width, zero forcing, and maximum nullity of a graph. J Graph Theory 72:146\u2013177","journal-title":"J Graph Theory"},{"key":"1089_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.dam.2017.05.016","volume":"229","author":"B Brimkov","year":"2017","unstructured":"Brimkov B, Hicks IV (2017) Complexity and computation of connected zero forcing. Discrete Appl Math 229:31\u201345","journal-title":"Discrete Appl Math"},{"key":"1089_CR5","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s11047-014-9438-5","volume":"14","author":"D Burgarth","year":"2015","unstructured":"Burgarth D, Giovannetti V, Hogben L, Severini S, Young M (2015) Logic circuits from zero forcing. Nat Comput 14:485\u2013490","journal-title":"Nat Comput"},{"key":"1089_CR6","doi-asserted-by":"crossref","unstructured":"Caro Y, Pepper R (2015) Dynamic approach to k-forcing, Theory Appl. Graphs 2. Article 2","DOI":"10.20429\/tag.2015.020202"},{"key":"1089_CR7","unstructured":"Davila R (2015) Bounding the forcing number of a graph. Rice University Masters Thesis"},{"key":"1089_CR8","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1007\/s00373-018-1934-4","volume":"34","author":"R Davila","year":"2018","unstructured":"Davila R, Henning MA (2018) Total forcing and zero forcing in claw-free cubic graphs. Graphs Combin 34:1371\u20131384","journal-title":"Graphs Combin"},{"key":"1089_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.dam.2018.09.001","volume":"257","author":"R Davila","year":"2019","unstructured":"Davila R, Henning MA (2019) On the total forcing number of a graph. Discrete Appl Math 257:115\u2013127","journal-title":"Discrete Appl Math"},{"key":"1089_CR10","first-page":"385","volume":"354","author":"R Davila","year":"2019","unstructured":"Davila R, Henning MA (2019) Total forcing versus total domination in cubic graphs. Appl Math Comput 354:385\u2013395","journal-title":"Appl Math Comput"},{"key":"1089_CR11","doi-asserted-by":"publisher","first-page":"733","DOI":"10.7151\/dmgt.2136","volume":"40","author":"R Davila","year":"2020","unstructured":"Davila R, Henning MA (2020) Total forcing sets and zero forcing sets in trees. Discuss Math Graph Theory 40:733\u2013754","journal-title":"Discuss Math Graph Theory"},{"key":"1089_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.2989\/16073606.2018.1542525","volume":"43","author":"R Davila","year":"2020","unstructured":"Davila R, Henning MA (2020) Matching, path covers, and total forcing sets. Quaest Math 43:131\u2013147","journal-title":"Quaest Math"},{"key":"1089_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.dam.2018.04.015","volume":"250","author":"R Davila","year":"2018","unstructured":"Davila R, Kalinowski T, Stephen S (2018) A lower bound on the zero forcing number. Discrete Appl Math 250:363\u2013367","journal-title":"Discrete Appl Math"},{"key":"1089_CR14","doi-asserted-by":"crossref","unstructured":"Davila R, Kenter F (2015) Bounds for the zero forcing number of a graph with large girth, Theory Appl. Graphs 2. Article 1","DOI":"10.20429\/tag.2015.020201"},{"key":"1089_CR15","doi-asserted-by":"publisher","first-page":"4352","DOI":"10.1016\/j.laa.2010.10.015","volume":"436","author":"C Edholm","year":"2012","unstructured":"Edholm C, Hogben L, LaGrange J, Row D (2012) Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph. Linear Algebra Appl 436:4352\u20134372","journal-title":"Linear Algebra Appl"},{"key":"1089_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.dam.2017.11.015","volume":"236","author":"M Gentner","year":"2018","unstructured":"Gentner M, Rautenbanch D (2018) Some bounds on the zero forcing number of a graph. Discrete Appl Math 236:203\u2013213","journal-title":"Discrete Appl Math"},{"key":"1089_CR17","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.dam.2016.06.004","volume":"214","author":"M Gentner","year":"2016","unstructured":"Gentner M, Penso L, Rautenbanch D, Souzab U (2016) Extremal values and bounds for the zero forcing number. Discrete Appl Math 214:196\u2013200","journal-title":"Discrete Appl Math"},{"key":"1089_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1137\/17M1133051","volume":"33","author":"T Kalinowski","year":"2019","unstructured":"Kalinowski T, Kam\u010dev N, Sudakov B (2019) The zero forcing number of graphs. SIAM J Discrete Math 33:95\u2013115","journal-title":"SIAM J Discrete Math"},{"key":"1089_CR19","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2012.04.003","volume":"160","author":"L Lu","year":"2012","unstructured":"Lu L, Wu B, Tang Z (2012) Proof of a conjecture on the zero forcing number of a graph. Discrete Appl Math 160:1994\u20132005","journal-title":"Discrete Appl Math"},{"key":"1089_CR20","doi-asserted-by":"publisher","first-page":"2562","DOI":"10.1109\/TAC.2014.2308619","volume":"59","author":"N Monshizadeh","year":"2014","unstructured":"Monshizadeh N, Zhang S, Camlibel M (2014) Zero forcing sets and controllability of dynamical systems defined on graphs. IEEE T Automat Contr 59:2562\u20132567","journal-title":"IEEE T Automat Contr"},{"key":"1089_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.laa.2015.06.025","volume":"484","author":"M Trefois","year":"2015","unstructured":"Trefois M, Delvenne JC (2015) Zero forcing sets, constrained matchings and minimum rank. Linear Algebra Appl 484:199\u2013218","journal-title":"Linear Algebra Appl"},{"key":"1089_CR22","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1080\/03081087.2018.1545829","volume":"68","author":"X Wang","year":"2020","unstructured":"Wang X, Wong D, Zhang Y (2020) Zero forcing number of a graph in terms of the number of pendant vertices. Linear Multilinear Algebra 68:1424\u20131433","journal-title":"Linear Multilinear Algebra"},{"key":"1089_CR23","doi-asserted-by":"publisher","first-page":"1812","DOI":"10.1016\/j.disc.2006.03.037","volume":"306","author":"M Zhao","year":"2006","unstructured":"Zhao M, Kang L, Chang G (2006) Power domination in graphs. Discrete Math 306:1812\u20131816","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01089-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01089-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01089-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T08:18:43Z","timestamp":1700641123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01089-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1089"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01089-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,11]]},"assertion":[{"value":"14 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"25"}}