{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T13:18:14Z","timestamp":1768483094795,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T00:00:00Z","timestamp":1538956800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1957-x","type":"journal-article","created":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T20:12:31Z","timestamp":1539029551000},"page":"1159-1174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Bounds on the Connected Forcing Number of a Graph"],"prefix":"10.1007","volume":"34","author":[{"given":"Randy","family":"Davila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Henning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colton","family":"Magnant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Pepper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,8]]},"reference":[{"issue":"7","key":"1957_CR1","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","volume":"428","author":"AIM Special Work Group","year":"2008","unstructured":"AIM Special 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":"1957_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2014.08.029","volume":"181","author":"D Amos","year":"2015","unstructured":"Amos, D., Caro, Y., Davila, R., Pepper, R.: Upper bounds on the $$k$$ k -forcing number of a graph. Discret. Appl. Math. 181, 1\u201310 (2015)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1957_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., 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"},{"issue":"12","key":"1957_CR4","doi-asserted-by":"publisher","first-page":"4373","DOI":"10.1016\/j.laa.2010.12.024","volume":"436","author":"F Barioli","year":"2012","unstructured":"Barioli, F., Barrett, W., Fallat, S.M., Hall, H.T., Hogben, L., van der Holst, H.: On the graph complement conjecture for minimum rank. Linear Algebra Appl. 436(12), 4373\u20134391 (2012)","journal-title":"Linear Algebra Appl."},{"key":"1957_CR5","unstructured":"Brimkov, B., Davila, R.: Characterizations of the connected forcing number of a graph. arXiv:1604.00740"},{"issue":"10","key":"1957_CR6","doi-asserted-by":"publisher","first-page":"100501","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(10), 100501 (2007)","journal-title":"Phys. Rev. Lett."},{"key":"1957_CR7","unstructured":"Burgarth, D., Giovannetti, V., Hogben, L., Severini, S., Young, M.: Logic circuits from zero forcing (2011). arXiv:1106.4403"},{"key":"1957_CR8","doi-asserted-by":"publisher","unstructured":"Caro, Y., Pepper, R.: Dynamic approach to $$k$$ k -forcing. Theory Appl. Graph 2(2), Article 2 (2015). https:\/\/doi.org\/10.20429\/tag.2015.020202","DOI":"10.20429\/tag.2015.020202"},{"issue":"1","key":"1957_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.jctb.2004.05.004","volume":"93","author":"S Chandran","year":"2005","unstructured":"Chandran, S., Subramanian, C.: Girth and treewidth. J. Combin. Theory B 93(1), 23\u201332 (2005)","journal-title":"J. Combin. Theory B"},{"key":"1957_CR10","series-title":"Automata, languages and programming","first-page":"254","volume-title":"A graph reduction step preserving element-connectivity and applications","author":"C Chekuri","year":"2009","unstructured":"Chekuri, C., Korula, N.: A graph reduction step preserving element-connectivity and applications. Automata, languages and programming, pp. 254\u2013265. Springer, New York (2009)"},{"key":"1957_CR11","unstructured":"Davila, R.: Bounding the forcing number of a graph. Rice University Masters Thesis (2015)"},{"key":"1957_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.dam.2018.04.015","volume":"250","author":"Randy Davila","year":"2018","unstructured":"Davila, R., Kalinowshi, T., Stephen, S.: A lower bound on the zero forcing number of a graph. Discret. Appl. Math. (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.04.015","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"1957_CR13","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.A.: The forcing number of a graph with large girth. Quaest. Math. 41(2), 189\u2013204 (2018)","journal-title":"Quaest. Math."},{"key":"1957_CR14","doi-asserted-by":"crossref","unstructured":"Davila, R., Kenter, F.: Bounds for the zero forcing number of a graph with large girth. Theory Appl. Graph 2(2):Article 1 (2015)","DOI":"10.20429\/tag.2015.020201"},{"issue":"8","key":"1957_CR15","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1016\/j.laa.2010.11.052","volume":"434","author":"L Deaett","year":"2011","unstructured":"Deaett, L.: The minimum semidefinite rank of a triangle-free graph. Linear Algebra Appl. 434(8), 1945\u20131955 (2011)","journal-title":"Linear Algebra Appl."},{"key":"1957_CR16","doi-asserted-by":"crossref","unstructured":"Dean, N., Ilic, A., Ramirez, I., Shen, J., Tian, K.: On the power dominating sets of hypercubes. In: IEEE 4th International Conference on Computational Science and Engineering (CSE), pp. 488\u2013491 (2011)","DOI":"10.1109\/CSE.2011.89"},{"issue":"12","key":"1957_CR17","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(12), 4352\u20134372 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"1957_CR18","doi-asserted-by":"crossref","first-page":"467","DOI":"10.21136\/MB.2014.143937","volume":"139","author":"L Eroh","year":"2014","unstructured":"Eroh, L., Kang, C., Yi, E.: Metric dimension and zero forcing number of two families of line graphs. Math. Bohemica 139(3), 467\u2013483 (2014)","journal-title":"Math. Bohemica"},{"key":"1957_CR19","unstructured":"F\u00fcrst, M., Rautenbach, D.: A short proof for a lower bound on the zero forcing number. arXiv:1705.08365"},{"key":"1957_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(92)90331-9","volume":"104","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Wu, M.: Spanning trees in graphs of minimum degree 4 or 5. Discret. Math. 104, 167\u2013183 (1992)","journal-title":"Discret. Math."},{"issue":"4","key":"1957_CR21","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes, T.W., Hedetniemi, S.T., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discret. Math. 15(4), 519\u2013529 (2002)","journal-title":"SIAM J. Discret. Math."},{"key":"1957_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"DJ Kleitman","year":"1991","unstructured":"Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SIAM J. Discret. Math. 4, 99\u2013106 (1991)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"1957_CR23","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.laa.2011.09.022","volume":"436","author":"S Meyer","year":"2012","unstructured":"Meyer, S.: Zero forcing sets and bipartite circulants. Linear Algebra Appl. 436(4), 888\u2013900 (2012)","journal-title":"Linear Algebra Appl."},{"key":"1957_CR24","doi-asserted-by":"crossref","unstructured":"Ore, O.: Theory of graphs. Am. Math. Soc. Colloq. Publ. 38 (1962)","DOI":"10.1090\/coll\/038"},{"key":"1957_CR25","unstructured":"Row, D.: Zero forcing number: Results for computation and comparison with other graph parameters (PhD Thesis). Iowa State University (2011)"},{"key":"1957_CR26","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0095-8956(81)80025-1","volume":"31","author":"C Thomassen","year":"1981","unstructured":"Thomassen, C., Toft, B.: Non-seperating induced cycles in graphs. J. Combin. Theory B 31, 199\u2013224 (1981)","journal-title":"J. Combin. Theory B"},{"key":"1957_CR27","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.laa.2015.06.025","volume":"484","author":"M Trefois","year":"2015","unstructured":"Trefois, M., Delvenne, J.-C.: Zero forcing number, constrained matchings and strong structural controllability. Linear Algebra Appl. 484, 199\u2013218 (2015)","journal-title":"Linear Algebra Appl."},{"key":"1957_CR28","doi-asserted-by":"publisher","first-page":"1812","DOI":"10.1016\/j.disc.2006.03.037","volume":"306","author":"M Zhao","year":"2006","unstructured":"Zhao, M., Kang, L., Chang, G.: Power domination in graphs. Discret. Math. 306, 1812\u20131816 (2006)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1957-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1957-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1957-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T09:29:00Z","timestamp":1605173340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1957-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,8]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1957"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1957-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,8]]},"assertion":[{"value":"1 June 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}