{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:47Z","timestamp":1740107147039,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T00:00:00Z","timestamp":1540339200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"AARMS"},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-341214-2013","RGPIN-04456-2016"],"award-info":[{"award-number":["RGPIN-341214-2013","RGPIN-04456-2016"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"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-1964-y","type":"journal-article","created":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T12:17:41Z","timestamp":1540383461000},"page":"1279-1294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6629-4556","authenticated-orcid":false,"given":"Aras","family":"Erzurumluo\u011flu","sequence":"first","affiliation":[]},{"given":"Karen","family":"Meagher","sequence":"additional","affiliation":[]},{"given":"David","family":"Pike","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"key":"1964_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"},{"key":"1964_CR2","unstructured":"Alfaro, C.A., Lin, J.C.-H.: Critical ideals, minimum rank and zero forcing number. arXiv:1710.03386"},{"issue":"1","key":"1964_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1137\/070703053","volume":"23","author":"Noga Alon","year":"2009","unstructured":"Alon, N., Pra\u0142at, P., Wormald, N.: Cleaning regular graphs with brushes. SIAM J Discrete Math 23(1), 233\u2013250 (2008\/09)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"1964_CR4","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(2), 401\u2013411 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1964_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., Fallat, S.M., Hall, H.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":"1964_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.disopt.2017.07.001","volume":"26","author":"B Bre\u0161ar","year":"2017","unstructured":"Bre\u0161ar, B., Bujt\u00e1s, C., Gologranc, T., Klav\u017ear, S., Ko\u0161mrlj, G., Patk\u00f3s, B., Tuza, Z., Vizer, M.: Grundy dominating sequences and zero forcing sets. Discrete Optim. 26, 66\u201377 (2017)","journal-title":"Discrete Optim."},{"key":"1964_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.dam.2014.01.024","volume":"170","author":"D Bryant","year":"2014","unstructured":"Bryant, D., Franceti\u0107, N., Gordinowicz, P., Pike, D.A., Pra\u0142at, P.: Brushing without capacity restrictions. Discrete Appl. Math. 170, 33\u201345 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"1964_CR8","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.X., Yi, E.: Metric dimension and zero forcing number of two families of line graphs. Math. Bohem. 139(3), 467\u2013483 (2014)","journal-title":"Math. Bohem."},{"key":"1964_CR9","unstructured":"Fallat, S., Meagher, K., Soltani, A., Yang, B.: Compressed cliques graphs, clique coverings and positive zero forcing. Submitted for publication"},{"key":"1964_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.laa.2015.03.011","volume":"491","author":"S Fallat","year":"2016","unstructured":"Fallat, S., Meagher, K., Yang, B.: On the complexity of the positive semidefinite zero forcing number. Linear Algebra Appl. 491, 101\u2013122 (2016)","journal-title":"Linear Algebra Appl."},{"issue":"141","key":"1964_CR11","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s10587-016-0290-x","volume":"66","author":"S Fallat","year":"2016","unstructured":"Fallat, S., Soltani, A.: Line graphs: their maximum nullities and zero forcing numbers. Czechoslovak Math. J. 66(141), 743\u2013755 (2016). 3","journal-title":"Czechoslovak Math. J."},{"issue":"10","key":"1964_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.ipl.2009.01.003","volume":"109","author":"S Gaspers","year":"2009","unstructured":"Gaspers, S., Messinger, M.-E., Nowakowski, R., Pra\u0142at, P.: Clean the graph before you draw it!. Inform Process. Lett. 109(10), 463\u2013467 (2009)","journal-title":"Inform Process. Lett."},{"key":"1964_CR13","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., Rautenbach, D.: Some bounds on the zero forcing number of a graph. Discrete Appl. Math. 236, 203\u2013213 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"1964_CR14","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1016\/j.laa.2010.01.001","volume":"432","author":"L-H Huang","year":"2010","unstructured":"Huang, L.-H., Chang, G.J., Yeh, H.-G.: On minimum rank and zero forcing sets of a graph. Linear Algebra Appl. 432(11), 2961\u20132973 (2010)","journal-title":"Linear Algebra Appl."},{"key":"1964_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2016.02.011","volume":"207","author":"WB Kinnersley","year":"2016","unstructured":"Kinnersley, W.B., Pra\u0142at, P.: Game brush number. Discrete Appl. Math. 207, 1\u201314 (2016)","journal-title":"Discrete Appl. Math."},{"key":"1964_CR16","unstructured":"Lin, J.C.-H.: Zero forcing number, Grundy domination number, and their variants. arXiv:1706.00798"},{"key":"1964_CR17","unstructured":"McKeil, S.G.: Graph Cleaning. M.Sc. Thesis. Dalhousie University (2007)"},{"key":"1964_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.tcs.2008.02.037","volume":"399","author":"M-E Messinger","year":"2008","unstructured":"Messinger, M.-E., Nowakowski, R.J., Pra\u0142at, P.: Cleaning a network with brushes. Theoret Comput. Sci. 399, 191\u2013205 (2008)","journal-title":"Theoret Comput. Sci."},{"key":"1964_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.dam.2015.06.004","volume":"194","author":"LD Penso","year":"2015","unstructured":"Penso, L.D., Rautenbach, D., Ribeiro de Almeida, A.: Brush your trees!. Discrete Appl. Math. 194, 167\u2013170 (2015)","journal-title":"Discrete Appl. Math."},{"key":"1964_CR20","first-page":"237","volume":"43","author":"P Pra\u0142at","year":"2009","unstructured":"Pra\u0142at, P.: Cleaning random graphs with brushes. Australas. J. Combin. 43, 237\u2013251 (2009)","journal-title":"Australas. J. Combin."},{"issue":"7","key":"1964_CR21","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2013.04.015","volume":"507","author":"B Yang","year":"2013","unstructured":"Yang, B.: Fast-mixed searching and related problems on graphs. Theoret. Comput. Sci. 507(7), 100\u2013113 (2013)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1964-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1964-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1964-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T23:26:32Z","timestamp":1605309992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1964-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,24]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1964"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1964-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,10,24]]},"assertion":[{"value":"19 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}