{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T09:34:05Z","timestamp":1768469645625,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T00:00:00Z","timestamp":1687305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T00:00:00Z","timestamp":1687305600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Shandong Provincial Natural Science Foundation of China","award":["ZR2019MA012"],"award-info":[{"award-number":["ZR2019MA012"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00373-023-02664-6","type":"journal-article","created":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T10:01:40Z","timestamp":1687341700000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Zero Forcing Number of Graphs with the Matching Number and the Cyclomatic Number"],"prefix":"10.1007","volume":"39","author":[{"given":"Yu","family":"Jing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5345-9953","authenticated-orcid":false,"given":"Shengjin","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,21]]},"reference":[{"key":"2664_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":"2664_CR2","unstructured":"Aazami, A.: Hardness results and approximation algorithms for some problems on graphs (Ph.D. thesis), University of Waterloo, (2008). uwspace. uwaterloo.ca\/handle\/10012\/4147"},{"key":"2664_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.laa.2010.03.008","volume":"433","author":"F Barioli","year":"2010","unstructured":"Barioli, F., Barrett, W., Fallat, S., Hall, H., Hogben, L., Shader, B., Driessche, P., Holst, H.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 433, 401\u2013411 (2010)","journal-title":"Linear Algebra Appl."},{"key":"2664_CR4","doi-asserted-by":"crossref","unstructured":"AIM Minimum Rank-Special Graphs Work Group (F. Barioli, W. Barrett, S. Butler, S. Cioab\u0103, D. Cvetkovi\u0107, S. Fallat, C. Godsil, W. Haemers, L. Hogben, R. Mikkelson, S. Narayan, O. Pryporova, I. Sciriha, W. So, D. Stevanovi\u0107, H. van der Holst, K. Vander Meulen, A. Wangsness), Zero forcing sets and the minimum rank of graphs, Linear Algebra Appl. 428 (2008) 1628-1648","DOI":"10.1016\/j.laa.2007.10.009"},{"key":"2664_CR5","unstructured":"Benson, K., Ferrero, D., Flagg, M., Furst, V., Hogben, L., Vasilevska, V., Wissman, B.: Power domination and zero forcing, arXiv e-prints, (2015)"},{"key":"2664_CR6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.99.100501","volume":"99","author":"D Burgarth","year":"2007","unstructured":"Burgarth, D., Giovannetti, V.: Full control by locally induced relaxation. Phys. Rev. Lett. 99, 100501 (2007)","journal-title":"Phys. Rev. Lett."},{"key":"2664_CR7","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":"2664_CR8","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 Heidelberg, Berlin, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02927-1_22"},{"key":"2664_CR9","first-page":"57","volume":"64","author":"K Chilakammari","year":"2012","unstructured":"Chilakammari, K., Dean, N., Kang, C., Yi, E.: Iteration index of a zero forcing set in a graph. Bull. Inst. Combin. Appl. 64, 57\u201372 (2012)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"2664_CR10","first-page":"189","volume":"41","author":"R Davila","year":"2018","unstructured":"Davila, R.: Bounding the forcing number of a graph. Rice University Master Thesis. 41, 189\u2013204 (2018)","journal-title":"Rice University Master Thesis."},{"key":"2664_CR11","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 set and zero forcing set in trees. Discuss. Math. Graph Theory. 40, 733\u2013754 (2020)","journal-title":"Discuss. Math. Graph Theory."},{"key":"2664_CR12","doi-asserted-by":"crossref","unstructured":"Davila, R., Kenter, F.: Bounds for the zero-forcing number of graphs with large girth, Theory Appl. Graphs. 2(2)(2015) Article 1","DOI":"10.20429\/tag.2015.020201"},{"key":"2664_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.: A lower bound on the zero forcing number. Discrete Appl. Math. 250, 363\u2013367 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"2664_CR14","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s41980-019-00290-8","volume":"46","author":"Z Montazeri","year":"2020","unstructured":"Montazeri, Z., Soltankhah, N.: On the Relationship Between the Zero Forcing Number and Path Cover Number for Some Graphs. Bull. Iranian Math. Society 46(3), 767\u2013776 (2020)","journal-title":"Bull. Iranian Math. Society"},{"key":"2664_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.: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph. Linear Algebra Appl. 436, 4352\u20134372 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"2664_CR16","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s10114-017-4699-4","volume":"33","author":"L Eroh","year":"2017","unstructured":"Eroh, L., Yi, C.: A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs, Acta Math. Sinica, English Series 33(6), 731\u2013747 (2017)","journal-title":"Sinica, English Series"},{"key":"2664_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.: Extremal values and bounds for the zero forcing number. Discrete Appl. Math. 214, 196\u2013200 (2016)","journal-title":"Discrete Appl. Math."},{"key":"2664_CR18","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.: Some bounds on the zero forcing number of a graph. Discrete Appl. Math. 236, 203\u2013213 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"2664_CR19","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"T Haynes","year":"2002","unstructured":"Haynes, T., Hedetniemi, S., Hedetniemi, S., Henning, M.: Domination in graphs applied to electric power networks. SIAM J. Discrete Math. 15(4), 519\u2013529 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"2664_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.cam.2018.05.055","volume":"354","author":"G Hern\u00e1ndez","year":"2019","unstructured":"Hern\u00e1ndez, G., Ranilla, J., Ranilla-Cortina, S.: Zero Forcing in triangulations. J. Comput. Appl. Math. 354, 123\u2013130 (2019)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"2664_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1137\/17M1133051","volume":"33","author":"T Kalinowski","year":"2019","unstructured":"Kalinowski, T., Kam\u0107ev, N., Sudakov, B.: The zero forcing number of graphs. SIAM J. Discrete Math. 33(1), 95\u2013115 (2019)","journal-title":"SIAM J. Discrete Math."},{"key":"2664_CR22","doi-asserted-by":"crossref","unstructured":"Barioli, F., Barrett, W., Fallat, S., Hall, T., Hogben, L., Shader, B., P.van den Driessche, and H. van der Holst,: Parameters related to tree-width, zero forcing, and maximum nullity of a graph. J. Graph Theory 72(2), 146\u2013177 (2013)","DOI":"10.1002\/jgt.21637"},{"key":"2664_CR23","doi-asserted-by":"publisher","first-page":"4352","DOI":"10.1016\/j.laa.2010.10.015","volume":"436","author":"J Edholm","year":"2012","unstructured":"Edholm, J., Hogben, L., Huynh, M., Lagrange, J., Row, D.: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph. Linear Algebra Appl. 436, 4352\u20134372 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"2664_CR24","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 given girth. Questiones Math. 41(2), 189\u2013204 (2018)","journal-title":"Questiones Math."},{"key":"2664_CR25","doi-asserted-by":"publisher","first-page":"1961","DOI":"10.1016\/j.laa.2009.05.003","volume":"432","author":"L Hogben","year":"2010","unstructured":"Hogben, L.: Minimum rank problems. Linear Algebra Appl. 432, 1961\u20131974 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"7","key":"2664_CR26","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.: Zero forcing number of a graph in terms of the number of pendant vertices. Linear and Multilinear Algebra 68(7), 1424\u20131433 (2020)","journal-title":"Linear and Multilinear Algebra"},{"key":"2664_CR27","first-page":"1","volume":"1","author":"Q Chen","year":"2021","unstructured":"Chen, Q., Huang, Q.: The maximal $$A_{\\alpha }$$-spectral radius of graphs with given matching number. Linear and Multilinear Algebra 1, 1\u201314 (2021)","journal-title":"Linear and Multilinear Algebra"},{"issue":"15","key":"2664_CR28","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.dam.2020.08.001","volume":"287","author":"X Duan","year":"2020","unstructured":"Duan, X., Ning, B., Peng, X., Wang, J., Yang, W.: Maximizing the number of cliques in graphs with given matching number. Discrete Appl. Math. 287(15), 110\u2013117 (2020)","journal-title":"Discrete Appl. Math."},{"key":"2664_CR29","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.laa.2006.09.014","volume":"422","author":"L Feng","year":"2007","unstructured":"Feng, L., Yu, G., Zhang, X.: Spectral radius of graphs with given matching number. Linear Algebra Appl. 422, 133\u2013138 (2007)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"2664_CR30","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.disc.2018.11.015","volume":"342","author":"X Hou","year":"2019","unstructured":"Hou, X., Yu, L., Gao, J., Liu, B.: The size of $$3$$-uniform hypergraphs with given matching number and codegree. Discrete Math. 342(3), 760\u2013767 (2019)","journal-title":"Discrete Math."},{"key":"2664_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2019.103000","volume":"82","author":"X Liu","year":"2019","unstructured":"Liu, X.: $$d$$-cluster-free sets with a given matching number. European J. Combin. 82, 103000 (2019)","journal-title":"European J. Combin."},{"key":"2664_CR32","unstructured":"Zhang, W., Wang, J., Wang, W., Ji, S.: On the zero forcing number and spectral radius of graphs, Electron. J. Combin. 27 (2020) $$\\sharp $$ P00"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02664-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02664-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02664-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T12:48:21Z","timestamp":1702644501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02664-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,21]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["2664"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02664-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,21]]},"assertion":[{"value":"16 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"72"}}