{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:14:54Z","timestamp":1757618094196,"version":"3.44.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T00:00:00Z","timestamp":1748304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T00:00:00Z","timestamp":1748304000000},"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","ZR2022MA077"],"award-info":[{"award-number":["ZR2019MA012","ZR2022MA077"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s00373-025-02925-6","type":"journal-article","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T12:01:24Z","timestamp":1748347284000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Extremal Results for Forcing Problem of Trees"],"prefix":"10.1007","volume":"41","author":[{"given":"Baoxin","family":"Li","sequence":"first","affiliation":[]},{"given":"Yahan","family":"Cao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5345-9953","authenticated-orcid":false,"given":"Shengjin","family":"Ji","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,27]]},"reference":[{"key":"2925_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2014.08.029","volume":"181","author":"D Aamos","year":"2015","unstructured":"Aamos, D., Caro, Y., Davila, R., Pepper, R.: Upper bounds on the $$k$$-forcing number of a graph. Discrete Appl. Math. 181, 1\u201310 (2015)","journal-title":"Discrete Appl. Math."},{"key":"2925_CR2","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","volume":"428","author":"AIM Minimum Rank-Special Graphs Work Group","year":"2008","unstructured":"AIM Minimum Rank-Special Graphs Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428, 1628\u20131648 (2008)","journal-title":"Linear Algebra Appl."},{"key":"2925_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.M.: Parameters related to tree-width, zero forcing, and maximum nullity of a graph. J. Graph Theory 72, 146\u2013177 (2013)","journal-title":"J. Graph Theory"},{"key":"2925_CR4","first-page":"515","volume":"2021","author":"N Bousquet","year":"2021","unstructured":"Bousquet, N., Deschamps, Q., Parreau, A.: On the cycle rank conjecture about metric dimension and zero forcing number in graphs. Extend. Abstr. Eur. Comb. Birkh\u00e4user Cham. 2021, 515\u2013520 (2021)","journal-title":"Extend. Abstr. Eur. Comb. Birkh\u00e4user Cham."},{"key":"2925_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.: Logic circuits from zero forcing. Nat. Comput. 14, 485\u2013490 (2015)","journal-title":"Nat. Comput."},{"key":"2925_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Korula, N.: A graph reduction step preserving element-connectivity and applications. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) Automata, pp. 254\u2013265. Languages and Programming, Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02927-1_22"},{"key":"2925_CR7","doi-asserted-by":"publisher","first-page":"971","DOI":"10.7151\/dmgt.2482","volume":"44","author":"H Chen","year":"2024","unstructured":"Chen, H., Li, J., Xu, S.: Spectral bounds for the zero forcing number of a graph. Discuss. Math. Graph Theory 44, 971\u2013982 (2024)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2925_CR8","unstructured":"Davila, R.: Bounding the forcing number of a graph. Master\u2019s Thesis, Rice University (2015)"},{"key":"2925_CR9","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, M.: Total forcing and zero forcing in claw-free cubic graphs. Graphs Combin. 34, 1371\u20131384 (2018)","journal-title":"Graphs Combin."},{"key":"2925_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.2989\/16073606.2017.1376230","volume":"41","author":"R Davila","year":"2018","unstructured":"Davila, R., Henning, M.: The forcing number of graphs with a given girth. Quaest. Math. 41, 189\u2013204 (2018)","journal-title":"Quaest. Math."},{"key":"2925_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.dam.2018.09.001","volume":"257","author":"R Davila","year":"2019","unstructured":"Davila, R., Henning, M.: On the total forcing number of a graph. Discrete Appl. Math. 257, 385\u2013395 (2019)","journal-title":"Discrete Appl. Math."},{"key":"2925_CR12","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s00373-018-1957-x","volume":"34","author":"R Davila","year":"2018","unstructured":"Davila, R., Henning, M., Magnant, C., Pepper, R.: Bounds on the connected forcing number of a graph. Graphs Combin. 34, 1159\u20131174 (2018)","journal-title":"Graphs Combin."},{"key":"2925_CR13","doi-asserted-by":"publisher","first-page":"733","DOI":"10.7151\/dmgt.2136","volume":"40","author":"R Davila","year":"2020","unstructured":"Davila, R., Henning, M.: Total forcing sets and zero forcing sets in trees. Discuss. Math. Graph Theory 40, 733\u2013754 (2020)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2925_CR14","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.: A lower bound on the zero forcing number. Discrete Appl. Math. 250, 363\u2013367 (2018)","journal-title":"Discrete Appl. Math."},{"key":"2925_CR15","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10114-017-4699-4","volume":"33","author":"L Eroh","year":"2017","unstructured":"Eroh, L., Kang, C., Yi, E.: A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs. Acta Math. Sin. Engl. Ser. 33, 731\u2013747 (2017)","journal-title":"Acta Math. Sin. Engl. Ser."},{"key":"2925_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., Rautenbach, D.: Some bounds on the zero forcing number of a graph. Discrete Appl. Math. 236, 203\u2013213 (2018)","journal-title":"Discrete Appl. Math."},{"key":"2925_CR17","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1016\/j.laa.2010.01.001","volume":"432","author":"L Huang","year":"2010","unstructured":"Huang, L., Chang, G., Yeh, H.: On minimum rank and zero forcing sets of a graph. Linear Algebra Appl. 432, 2961\u20132973 (2010)","journal-title":"Linear Algebra Appl."},{"key":"2925_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00373-021-02402-w","volume":"38","author":"M He","year":"2022","unstructured":"He, M., Ji, S.: Note on forcing problem of trees. Graphs Combin. 38, 3 (2022)","journal-title":"Graphs Combin."},{"key":"2925_CR19","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.: The zero forcing number of graphs. SIAM J. Discrete Math. 33, 95\u2013115 (2019)","journal-title":"SIAM J. Discrete Math."},{"key":"2925_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00373-022-02591-y","volume":"38","author":"Y Liang","year":"2022","unstructured":"Liang, Y., Li, J., Xu, S.: On extremal graphs for zero forcing number. Graphs Combin. 38, 185 (2022)","journal-title":"Graphs Combin."},{"key":"2925_CR21","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.dam.2016.05.009","volume":"213","author":"L Lu","year":"2016","unstructured":"Lu, L., Wu, B., Tang, Z.: Proof of a conjecture on the zero forcing number of a graph. Discrete Appl. Math. 213, 233\u2013237 (2016)","journal-title":"Discrete Appl. Math."},{"key":"2925_CR22","first-page":"30","volume":"2","author":"F Taklimi","year":"2004","unstructured":"Taklimi, F., Fallt, S., Meagher, K.: On the relationships between zero forcing numbers and certain graphs coverings. Spec. Matrix. 2, 30\u201345 (2004)","journal-title":"Spec. Matrix."},{"key":"2925_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, W., Wang, J., Wang, W., Ji, S.: On the zero forcing number and spectral radius of graphs. Electron. J. Combin.29, #P1.33 (2022)","DOI":"10.37236\/10638"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02925-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02925-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02925-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T16:06:35Z","timestamp":1757174795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02925-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,27]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2925"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02925-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,5,27]]},"assertion":[{"value":"13 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2025","order":3,"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 interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"70"}}