{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T21:57:26Z","timestamp":1753739846235,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T00:00:00Z","timestamp":1712707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T00:00:00Z","timestamp":1712707200000},"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":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s12190-024-02064-w","type":"journal-article","created":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T15:02:00Z","timestamp":1712761320000},"page":"2665-2675","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes"],"prefix":"10.1007","volume":"70","author":[{"given":"Fatemeh","family":"Afzali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1731-4295","authenticated-orcid":false,"given":"Amir Hossein","family":"Ghodrati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid Reza","family":"Maimani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,10]]},"reference":[{"key":"2064_CR1","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":"2064_CR2","first-page":"1","volume-title":"Handbook of Linear Algebra","author":"SM Fallat","year":"2014","unstructured":"Fallat, S.M., Hogben, L.: Minimum rank, maximum nullity, and zero forcing number of graphs. In: Hogben, L. (ed.) Handbook of Linear Algebra, 2nd edn., pp. 1\u201346. CRC Press, Boca Raton, FL (2014)","edition":"2"},{"key":"2064_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.M., Hall, H.T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 433, 401\u2013411 (2010)","journal-title":"Linear Algebra Appl."},{"key":"2064_CR4","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.laa.2007.05.036","volume":"426","author":"SM Fallat","year":"2007","unstructured":"Fallat, S.M., Hogben, L.: The minimum rank of symmetric matrices described by a graph: a survey. Linear Algebra Appl. 426, 558\u2013582 (2007)","journal-title":"Linear Algebra Appl."},{"key":"2064_CR5","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, 99\u2013117 (2015)","journal-title":"Involve"},{"key":"2064_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2016.11.032","volume":"660","author":"Y Shitov","year":"2017","unstructured":"Shitov, Y.: On the complexity of failed zero forcing. Theor. Comput. Sci. 660, 102\u2013104 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"2064_CR7","doi-asserted-by":"publisher","first-page":"2221","DOI":"10.3390\/sym13112221","volume":"13","author":"L Gomez","year":"2021","unstructured":"Gomez, L., Rubi, K., Terrazas, J., Narayan, D.A.: All graphs with a failed zero forcing number of two. Symmetry 13, 2221 (2021)","journal-title":"Symmetry"},{"key":"2064_CR8","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, 493\u2013504 (2023)","journal-title":"Involve"},{"key":"2064_CR9","unstructured":"Allan, P., Pelayo, B., Nerissa, Ma., Abara, M.: Maximal failed zero forcing sets for products of two graphs (2022). arXiv:2202.04997"},{"key":"2064_CR10","unstructured":"Allan, P., Pelayo, B., Nerissa, Ma., Abara, M.: Minimum rank and failed zero forcing number of graphs (2022). arXiv:2202.04993"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02064-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02064-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02064-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T13:03:55Z","timestamp":1717160635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02064-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,10]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2064"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02064-w","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2024,4,10]]},"assertion":[{"value":"9 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not Applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}