{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:38:42Z","timestamp":1725849522635},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319295152"},{"type":"electronic","value":"9783319295169"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29516-9_28","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T05:05:19Z","timestamp":1455858319000},"page":"334-345","source":"Crossref","is-referenced-by-count":1,"title":["On the Zero Forcing Number of Bijection Graphs"],"prefix":"10.1007","author":[{"given":"Denys","family":"Shcherbak","sequence":"first","affiliation":[]},{"given":"Gerold","family":"J\u00e4ger","sequence":"additional","affiliation":[]},{"given":"Lars-Daniel","family":"\u00d6hman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,20]]},"reference":[{"key":"28_CR1","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 \n                    \n                      \n                    \n                    $$k$$\n                  -forcing number of a graph. Discrete Appl. Math. 181, 1\u201310 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"28_CR2","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","volume":"428","author":"F Barioli","year":"2008","unstructured":"Barioli, F., et al.: (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."},{"issue":"2","key":"28_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., et al.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 433(2), 401\u2013411 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"7","key":"28_CR4","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., et al.: An upper bound for the minimum rank of a graph. Linear Algebra Appl. 429(7), 1629\u20131638 (2008)","journal-title":"Linear Algebra Appl."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"100","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, 100\u2013501 (2007)","journal-title":"Phys. Rev. Lett."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"103019","DOI":"10.1088\/1367-2630\/11\/10\/103019","volume":"11","author":"D Burgarth","year":"2009","unstructured":"Burgarth, D., Maruyama, K.: Indirect hamiltonian identification through a small gateway. New J. Phys. 11, 103019 (2009)","journal-title":"New J. Phys."},{"key":"28_CR7","first-page":"57","volume":"64","author":"KB Chilakamarri","year":"2012","unstructured":"Chilakamarri, K.B., Dean, N., Kang, C.X., Yi, E.: Iteration index of a zero forcing set in a graph. Bull. Inst. Combin. Appl. 64, 57\u201372 (2012)","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"4","key":"28_CR8","first-page":"433","volume":"3","author":"F Harary","year":"1967","unstructured":"Harary, F., Chartrand, C.: Planar permutation graphs. Annales de l\u2019I.H.P. (B) Probabilit\u00e9s et Statistiques 3(4), 433\u2013438 (1967)","journal-title":"Annales de l\u2019I.H.P. (B) Probabilit\u00e9s et Statistiques"},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discrete Math. 15(4), 519\u2013529 (2002)","journal-title":"SIAM J. Discrete Math."},{"issue":"12","key":"28_CR10","doi-asserted-by":"publisher","first-page":"4423","DOI":"10.1016\/j.laa.2011.05.012","volume":"436","author":"DD Row","year":"2012","unstructured":"Row, D.D.: A technique for computing the zero forcing number of a graph with a cut-vertex. Linear Algebra Appl. 436(12), 4423\u20134432 (2012)","journal-title":"Linear Algebra Appl."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"482001","DOI":"10.1088\/1751-8113\/41\/48\/482002","volume":"41","author":"S Severini","year":"2008","unstructured":"Severini, S.: Nondiscriminatory propagation on trees. J. Phys. A: Math. Theor. 41, 482001 (2008)","journal-title":"J. Phys. A: Math. Theor."},{"key":"28_CR12","volume-title":"Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica","author":"S Skiena","year":"1990","unstructured":"Skiena, S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley, Reading, MA (1990)"},{"key":"28_CR13","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 sets, constrained matchings and strong structural controllability. Linear Algebra Appl 484, 199\u2013218 (2015). \n                    arXiv:1405.6222v1","journal-title":"Linear Algebra Appl"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-31770-5_6","volume-title":"Combinatorial Optimization and Applications","author":"E Yi","year":"2012","unstructured":"Yi, E.: On zero forcing number of permutation graphs. In: Lin, G. (ed.) COCOA 2012. LNCS, vol. 7402, pp. 61\u201372. Springer, Heidelberg (2012)"},{"issue":"15","key":"28_CR15","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.J.: Power domination in graphs. Discrete Math. 306(15), 1812\u20131816 (2006)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29516-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:54:41Z","timestamp":1559400881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29516-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319295152","9783319295169"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29516-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}