{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:21Z","timestamp":1725490221348},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_6","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:03:12Z","timestamp":1343278992000},"page":"61-72","source":"Crossref","is-referenced-by-count":2,"title":["On Zero Forcing Number of Permutation Graphs"],"prefix":"10.1007","author":[{"given":"Eunjeong","family":"Yi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","first-page":"1628","volume":"428\/7","author":"F. Barioli","year":"2008","unstructured":"(AIM Minimum Rank - Special Graphs Work Group) Barioli, F., Barrett, W., Butler, S., Cioab\u0103, S.M., Cvetkovi\u0107, D., Fallat, S.M., Godsil, C., Haemers, W., Hogben, L., Mikkelson, R., Narayan, S., Pryporova, O., Sciriha, I., So, W., Stevanovi\u0107, D., van der Holst, H., Vander Meulen, K., Wehe, A.W.: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl.\u00a0428\/7, 1628\u20131648 (2008)","journal-title":"Linear Algebra Appl."},{"key":"6_CR2","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.\u00a0433, 401\u2013411 (2010)","journal-title":"Linear Algebra Appl."},{"key":"6_CR3","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., Friedland, S., Hogben, L., Rothblum, U.G., Shader, B.: An upper bound for the minimum rank of a graph. Linear Algebra Appl.\u00a0429, 1629\u20131638 (2008)","journal-title":"Linear Algebra Appl."},{"key":"6_CR4","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.\u00a099, 100501 (2007)","journal-title":"Phys. Rev. Lett."},{"key":"6_CR5","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.\u00a011, 103019 (2009)","journal-title":"New J. Phys."},{"key":"6_CR6","first-page":"433","volume":"3","author":"G. Chartrand","year":"1967","unstructured":"Chartrand, G., Harary, F.: Planar permutation graphs. Ann. Inst. H. Poincare (Sect. B)\u00a03, 433\u2013438 (1967)","journal-title":"Ann. Inst. H. Poincare (Sect. B)"},{"key":"6_CR7","volume-title":"Introduction to Graph Theory","author":"G. Chartrand","year":"2004","unstructured":"Chartrand, G., Zhang, P.: Introduction to Graph Theory. McGraw-Hill, Kalamazoo (2004)"},{"key":"6_CR8","first-page":"57","volume":"64","author":"K. Chilakamarri","year":"2012","unstructured":"Chilakamarri, K., Dean, N., Kang, C.X., Yi, E.: Iteration Index of a Zero Forcing Set in a Graph. Bull. Inst. Combin. Appl.\u00a064, 57\u201372 (2012)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"4352","DOI":"10.1016\/j.laa.2010.10.015","volume":"436","author":"C.J. Edholm","year":"2012","unstructured":"Edholm, C.J., Hogben, L., Hyunh, M., LaGrange, J., Row, D.D.: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph. Linear Algebra Appl.\u00a0436, 4352\u20134372 (2012)","journal-title":"Linear Algebra Appl."},{"key":"6_CR10","unstructured":"Eroh, L., Kang, C.X., Yi, E.: A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs (submitted)"},{"key":"6_CR11","unstructured":"Eroh, L., Kang, C.X., Yi, E.: A Comparison between the Metric Dimension and Zero Forcing Number of Line Graphs (submitted)"},{"key":"6_CR12","unstructured":"Eroh, L., Kang, C.X., Yi, E.: On Zero Forcing Number of Graphs and Their Complements (submitted)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.laa.2007.05.036","volume":"426","author":"S.M. Fallat","year":"2007","unstructured":"Fallat, S.M., Hogben, L.: The minimum rank of symmetric matrices described by a graph: A survey. Linear Algebra Appl.\u00a0426, 558\u2013582 (2007)","journal-title":"Linear Algebra Appl."},{"key":"6_CR14","unstructured":"Fallet, S.M., Hogben, L.: Variants on the minimum rank problem: A survey II. arXiv:1102.5142v1"},{"key":"6_CR15","unstructured":"Hogben, L., Huynh, M., Kingsley, N., Meyer, S., Walker, S., Young, M.: Propagation time for zero forcing on a graph (preprint)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1080\/01445340802354580","volume":"57","author":"C.R. Johnson","year":"2009","unstructured":"Johnson, C.R., Loewy, R., Smith, P.A.: The graphs for which the maximum multiplicity of an eigenvalue is two. Linear Multilinear Algebra\u00a057, 713\u2013736 (2009)","journal-title":"Linear Multilinear Algebra"},{"key":"6_CR17","unstructured":"Kang, C.X., Yi, E.: On Zero Forcing Number of Functigraphs (submitted)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Row, D.D.: A technique for computing the zero forcing number of a graph with a cut-vertex. Linear Algebra Appl., doi:10.1016\/j.laa.2011.05.012","DOI":"10.1016\/j.laa.2011.05.012"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"482002","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.\u00a041, 482002 (2008)","journal-title":"J. Phys. A: Math. Theor."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:51Z","timestamp":1620128871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}