{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:53Z","timestamp":1748404913368,"version":"3.41.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00373-025-02891-z","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T14:41:58Z","timestamp":1737470518000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Number of Minimal Forts of a Graph"],"prefix":"10.1007","volume":"41","author":[{"given":"Paul","family":"Becker","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8708-4336","authenticated-orcid":false,"given":"Thomas R.","family":"Cameron","sequence":"additional","affiliation":[]},{"given":"Derek","family":"Hanely","sequence":"additional","affiliation":[]},{"given":"Boon","family":"Ong","sequence":"additional","affiliation":[]},{"given":"Joseph P.","family":"Previte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,21]]},"reference":[{"key":"2891_CR1","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."},{"issue":"7","key":"2891_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(7), 1628\u20131648 (2008)","journal-title":"Linear Algebra Appl."},{"key":"2891_CR3","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/270","volume-title":"Inverse Problems and Zero Forcing for Graphs","author":"L Hogben","year":"2022","unstructured":"Hogben, L., Lin, J.C.-H., Shader, B.L.: Inverse Problems and Zero Forcing for Graphs. American Mathematical Society, Providence, RI (2022)"},{"key":"2891_CR4","unstructured":"Aazami, A.: Hardness results and approximation algorithms for some problems on graphs. PhD Thesis, University of Waterloo (2008)"},{"key":"2891_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.dam.2019.03.027","volume":"269","author":"A Agra","year":"2019","unstructured":"Agra, A., Cerdeira, J.O., Requejo, C.: A computational comparison of compact milp formulations for the zero forcing number. Discrete Appl. Math. 269, 169\u2013183 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"2891_CR6","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.ejor.2018.09.030","volume":"273","author":"B Brimkov","year":"2019","unstructured":"Brimkov, B., Fast, C.C., Hicks, I.V.: Computational approaches for zero forcing and related problems. Eur. J. Oper. Res. 273(3), 889\u2013903 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2891_CR7","first-page":"1384","volume":"33","author":"B Brimkov","year":"2021","unstructured":"Brimkov, B., Mikesell, D., Hicks, I.V.: Improved computational approaches and heuristics for zero forcing. INFORMS J. Comput. 33(4), 1384\u20131399 (2021)","journal-title":"INFORMS J. Comput."},{"key":"2891_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.dam.2018.05.002","volume":"250","author":"C Fast","year":"2018","unstructured":"Fast, C., Hicks, I.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."},{"key":"2891_CR9","unstructured":"Abara, M.N.M., Pelayo, P.A.B.: Maximal failed zero forcing sets for products of two graphs. Preprint arXiv:2202.04997 (2022)"},{"issue":"1","key":"2891_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2140\/involve.2015.8.99","volume":"8","author":"K Fetcie","year":"2015","unstructured":"Fetcie, K., Jacob, B., Saavedra, D.: The failed zero forcing number of a graph. Involve 8(1), 99\u2013117 (2015)","journal-title":"Involve"},{"issue":"3","key":"2891_CR11","doi-asserted-by":"publisher","first-page":"493","DOI":"10.2140\/involve.2023.16.493","volume":"16","author":"N Swanson","year":"2023","unstructured":"Swanson, N., Ufferman, E.: A lower bound on the failed zero-forcing number of a graph. Involve 16(3), 493\u2013504 (2023)","journal-title":"Involve"},{"key":"2891_CR12","unstructured":"Cameron, T.R., Hogben, L., Kenter, F.H.J., Mojallal, S.A., Schuerger, H.: Forts, (fractional) zero forcing, and Cartesian products of graphs. Preprint arXiv:2310.17904 (2023)"},{"key":"2891_CR13","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner, E.: Eiin Satz \u00fcber Untermengen einer endliche Mengen. Math. Z. 27, 544\u2013548 (1928)","journal-title":"Math. Z."},{"key":"2891_CR14","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393\u2013410 (1954)","journal-title":"Oper. Res."},{"key":"2891_CR15","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1999)"},{"key":"2891_CR16","volume-title":"Introductory Combinatorics","author":"RA Brualdi","year":"1992","unstructured":"Brualdi, R.A.: Introductory Combinatorics, 2nd edn. Elsevier Science Publishing Co., Inc., New York (1992)","edition":"2"},{"key":"2891_CR17","unstructured":"OEIS Foundation Inc.: The On-Line Encyclopedia of Integer Sequences. Published electronically at http:\/\/oeis.org (2024)"},{"key":"2891_CR18","unstructured":"Bisdorff, R., Marichal, J.-L.: Counting non-isomorphic maximal independent sets of the $$n$$-cycle graph. J. Integer Seq. 11(5), Article 08.5.7 (2008)"},{"issue":"4","key":"2891_CR19","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1002\/jgt.3190110403","volume":"11","author":"Z F\u00fcredi","year":"1987","unstructured":"F\u00fcredi, Z.: The number of maximal independent sets in connected graphs. J. Graph Theory 11(4), 463\u2013470 (1987)","journal-title":"J. Graph Theory"},{"issue":"4","key":"2891_CR20","doi-asserted-by":"publisher","first-page":"333","DOI":"10.4169\/amer.math.monthly.119.04.333","volume":"119","author":"IE Lenoard","year":"2012","unstructured":"Lenoard, I.E., Liu, A.C.F.: A familiar recurrence occurs again. Am. Math. Mon. 119(4), 333\u2013336 (2012)","journal-title":"Am. Math. Mon."},{"issue":"1","key":"2891_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.4169\/math.mag.84.1.033","volume":"84","author":"G Minton","year":"2011","unstructured":"Minton, G.: Three approaches to a sequence problem. Math. Mag. 84(1), 33\u201337 (2011)","journal-title":"Math. Mag."},{"issue":"7","key":"2891_CR22","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1080\/00207390600712554","volume":"37","author":"AG Shannon","year":"2006","unstructured":"Shannon, A.G., Anderson, P.G., Horadam, A.F.: Properties of Cordonnier, Perrin and Van der Laan numbers. Int. J. Math. Educ. Sci. Technol. 37(7), 825\u2013831 (2006)","journal-title":"Int. J. Math. Educ. Sci. Technol."},{"issue":"4","key":"2891_CR23","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1080\/00150517.2019.12427628","volume":"57","author":"SJ Tedford","year":"2019","unstructured":"Tedford, S.J.: Combinatorial identities for the Padovan numbers. Fibonacci Q. 57(4), 291\u2013298 (2019)","journal-title":"Fibonacci Q."},{"key":"2891_CR24","volume-title":"Mathematical Constants","author":"SR Finch","year":"2003","unstructured":"Finch, S.R.: Mathematical Constants. Cambridge University Press, Cambridge (2003)"},{"key":"2891_CR25","volume-title":"Graph Theory","author":"R Diestel","year":"2016","unstructured":"Diestel, R.: Graph Theory, 5th edn. Springer, Heidelberg (2016)","edition":"5"},{"key":"2891_CR26","unstructured":"Hanely, D.: SageMath code for \u201cOn the number of minimal forts of a graph.\u201d Available at https:\/\/cocalc.com\/share\/public_paths\/c556f32f54db7ac64d2083d8d3932d83c8803e21"},{"issue":"2\u20133","key":"2891_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(88)90114-8","volume":"68","author":"JR Griggs","year":"1988","unstructured":"Griggs, J.R., Grinstead, C.M., Guichard, D.R.: The number of maximal independent sets in a connected graph. Discrete Math. 68(2\u20133), 211\u2013220 (1988)","journal-title":"Discrete Math."},{"key":"2891_CR28","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Isr. J. Math. 3, 23\u201328 (1965)","journal-title":"Isr. J. Math."},{"issue":"1","key":"2891_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1137\/0607015","volume":"7","author":"HS Wilf","year":"1986","unstructured":"Wilf, H.S.: The number of maximal independent sets in a tree. SIAM J. Discrete Math. 7(1), 125\u2013130 (1986)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02891-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02891-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02891-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:45Z","timestamp":1748319765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02891-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,21]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2891"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02891-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,1,21]]},"assertion":[{"value":"20 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"25"}}