{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T09:40:04Z","timestamp":1748857204547,"version":"3.41.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T00:00:00Z","timestamp":1744329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T00:00:00Z","timestamp":1744329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2331072"],"award-info":[{"award-number":["DMS-2331072"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2023YFA1011500"],"award-info":[{"award-number":["2023YFA1011500"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00373-025-02919-4","type":"journal-article","created":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T14:33:34Z","timestamp":1744382014000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compatible Forts and Maximum Nullity of a Graph"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0236-2059","authenticated-orcid":false,"given":"Veronika","family":"Furst","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9843-2359","authenticated-orcid":false,"given":"John","family":"Hutchens","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3524-5377","authenticated-orcid":false,"given":"Lon","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Yaqi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,11]]},"reference":[{"key":"2919_CR1","doi-asserted-by":"crossref","unstructured":"AIM Minimum Rank-Special graphs work group, zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7), 1628\u20131648 (2008)","DOI":"10.1016\/j.laa.2007.10.009"},{"issue":"5","key":"2919_CR2","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00373-010-0946-5","volume":"26","author":"S Akbari","year":"2010","unstructured":"Akbari, S., Daemi, A., Hatami, O., Javanmard, A., Mehrabian, A.: Zero-sum flows in regular graphs. Graph Combin. 26(5), 603\u2013615 (2010)","journal-title":"Graph Combin."},{"key":"2919_CR3","doi-asserted-by":"crossref","unstructured":"Akbari, S., Ghareghani, N., Khosrovshahi, G.B., Mahmoody, A.: On zero-sum 6-flows of graphs. Linear Algebra Appl. 430(11\u201312), 3047\u20133052 (2009)","DOI":"10.1016\/j.laa.2009.01.027"},{"issue":"2","key":"2919_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00373-023-02745-6","volume":"40","author":"S Allred","year":"2024","unstructured":"Allred, S., Curl, E., Fallat, S., Nasserasr, S., Schuerger, H., Villagr\u00e1n, R.R., Vishwakarma, P.K.: The strong spectral property of graphs: graph operations and barbell partitions. Graph Combin. 40(2), 20\u201325 (2024)","journal-title":"Graph Combin."},{"issue":"2","key":"2919_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1002\/jgt.21637","volume":"72","author":"F Barioli","year":"2013","unstructured":"Barioli, F., Barrett, W., Shaun, M., Fallat, H., Hall, T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Parameters related to tree-width, zero forcing, and maximum nullity of a graph. J. Graph Theory 72(2), 146\u2013177 (2013)","journal-title":"J. Graph Theory"},{"key":"2919_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.laa.2004.06.019","volume":"392","author":"F Barioli","year":"2004","unstructured":"Barioli, F., Fallat, S., Hogben, L.: Computation of minimal rank and path cover number for certain graphs. Linear Algebra Appl. 392, 289\u2013303 (2004)","journal-title":"Linear Algebra Appl."},{"issue":"7","key":"2919_CR7","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1016\/j.laa.2008.04.038","volume":"429","author":"A Berman","year":"2008","unstructured":"Berman, A., Friedland, S., Hogben, L., Rothblum, U.G., Shader, B.: An upper bound for the minimum rank of a graph. Linear Algebra Appl. 429(7), 1629\u20131638 (2008)","journal-title":"Linear Algebra Appl."},{"key":"2919_CR8","unstructured":"Cameron, T.R., Hogben, L., Kenter, F.H.J., Mojallal, S.A., Schuerger, H.: Forts, (fractional) zero forcing, and Cartesian products of graphs, https:\/\/arxiv.org\/abs\/2310.17904 (2023)"},{"key":"2919_CR9","doi-asserted-by":"publisher","first-page":"591","DOI":"10.13001\/ela.2023.8025","volume":"39","author":"L Deaett","year":"2023","unstructured":"Deaett, L., Fallat, S., Furst, V., Hutchens, J., Mitchell, L., Zhang, Y.: Sparks of symmetric matrices and their graphs. Electron. J. Linear Algebr. 39, 591\u2013606 (2023)","journal-title":"Electron. J. Linear Algebr."},{"key":"2919_CR10","doi-asserted-by":"crossref","unstructured":"DeLoss, L., Grout, J., Hogben, L., McKay, T., Smith, J., Tims, G.: Techniques for determining the minimum rank of a small graph. Linear Algebra Appl. 432(11), 2995\u20133001 (2010)","DOI":"10.1016\/j.laa.2010.01.008"},{"key":"2919_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.dam.2018.05.002","volume":"250","author":"Caleb C Fast","year":"2018","unstructured":"Fast, Caleb C., Hicks, Illya V.: Effects of vertex degrees on the zero-forcing number and propagation time of a graph. Discrete Appl. Math. 250, 215\u2013226 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"2919_CR12","doi-asserted-by":"publisher","first-page":"2868","DOI":"10.1287\/ijoc.2022.1219","volume":"34","author":"IV Hicks","year":"2022","unstructured":"Hicks, I.V., Boris, B., Louis, D., Ruth, H., Derek, M., David, R., Logan, S.: Computational and theoretical challenges for computing the minimum rank of a graph. Inf. J. Comput. 34(6), 2868\u20132872 (2022)","journal-title":"Inf. J. Comput."},{"key":"2919_CR13","unstructured":"Hogben, L. (ed.): Handbook of linear algebra. In: Discrete Mathematics and its Applications, 2nd edn. CRC Press, Boca Raton, FL (2014)"},{"key":"2919_CR14","doi-asserted-by":"crossref","unstructured":"Hogben, L., Lin, J.C.-H., Shader, B.\u00a0L.: Inverse problems and zero forcing for graphs Vol. 270 of Mathematical Surveys and Monographs, American Mathematical Society, Providence, RI (2022)","DOI":"10.1090\/surv\/270"},{"key":"2919_CR15","doi-asserted-by":"crossref","unstructured":"Lin, J.C.-H.: Odd cycle zero forcing parameters and the minimum rank of graph blowups. Electron. J. Linear Algebr. 31, 42\u201359 (2016)","DOI":"10.13001\/1081-3810.2836"},{"key":"2919_CR16","doi-asserted-by":"crossref","unstructured":"Lin, J.C.-H., Oblak, P., Smigoc, H.: The strong spectral property for graphs. Linear Algebra Appl. 598, 68\u201391 (2020)","DOI":"10.1016\/j.laa.2020.03.031"},{"key":"2919_CR17","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L: Graphs and geometry Vol. 65 of American Mathematical Society Colloquium Publications, American Mathematical Society, Providence, RI (2019)","DOI":"10.1090\/coll\/065"},{"key":"2919_CR18","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Nullspace embeddings for outerplanar graphs. In: A Journey Through Discrete Mathematics, pp. 571\u2013591. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-44479-6_23"},{"issue":"4","key":"2919_CR19","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1093\/qmath\/hat031","volume":"65","author":"D Mayhew","year":"2014","unstructured":"Mayhew, D., Whittle, G., Newman, M.: Is the missing axiom of matroid theory lost forever? Q. J. Math. 65(4), 1397\u20131415 (2014)","journal-title":"Q. J. Math."},{"issue":"2","key":"2919_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1112\/blms.12141","volume":"50","author":"P Nelson","year":"2018","unstructured":"Nelson, P.: Almost all matroids are nonrepresentable. Bull. Lond. Math. Soc. 50(2), 245\u2013248 (2018)","journal-title":"Bull. Lond. Math. Soc."},{"key":"2919_CR21","unstructured":"Oxley, J.: Matroid theory (second edition), Vol. 21 of Oxford Graduate Texts in Mathematics, Oxford University Press, Oxford (2011)"},{"issue":"2","key":"2919_CR22","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1112\/jlms\/s2-2.2.284","volume":"2","author":"MJ Piff","year":"1970","unstructured":"Piff, M.J., Welsh, D.J.A.: On the vector representation of matroids. J. London Math. Soc. (2) 2(2), 284\u2013288 (1970)","journal-title":"J. London Math. Soc. (2)"},{"key":"2919_CR23","unstructured":"West, D.B: Introduction to graph theory. Prentice Hall Inc, Upper Saddle River, NJ (1996)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02919-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02919-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02919-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T09:15:29Z","timestamp":1748855729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02919-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,11]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2919"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02919-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,4,11]]},"assertion":[{"value":"11 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 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 of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"56"}}