{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:30:40Z","timestamp":1742938240966,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_27","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"356-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Comparison Between the Zero Forcing Number and the Strong Metric Dimension of Graphs"],"prefix":"10.1007","author":[{"given":"Cong X.","family":"Kang","sequence":"first","affiliation":[]},{"given":"Eunjeong","family":"Yi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"27_CR1","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., 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., Wehe, A.W.: (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":"27_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.laa.2004.09.014","volume":"409","author":"F Barioli","year":"2005","unstructured":"Barioli, F., Fallat, S., Hogben, L.: On the difference between the maximum multiplicity and path cover number for tree-like graphs. Linear Algebra Appl. 409, 13\u201331 (2005)","journal-title":"Linear Algebra Appl."},{"key":"27_CR3","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, 100501 (2007)","journal-title":"Phys. Rev. Lett."},{"key":"27_CR4","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":"27_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","volume":"105","author":"G Chartrand","year":"2000","unstructured":"Chartrand, G., Eroh, L., Johnson, M.A., Oellermann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105, 99\u2013113 (2000)","journal-title":"Discrete Appl. Math."},{"key":"27_CR6","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. 64, 57\u201372 (2012)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"4352","DOI":"10.1016\/j.laa.2010.10.015","volume":"436","author":"CJ Edholm","year":"2012","unstructured":"Edholm, C.J., Hogben, L., Huynh, 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. 436, 4352\u20134372 (2012)","journal-title":"Linear Algebra Appl."},{"key":"27_CR8","unstructured":"Eroh, L., Kang, C.X., Yi, E.: A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs. arXiv:1408.5943"},{"key":"27_CR9","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, 467\u2013483 (2014)","journal-title":"Math. Bohem."},{"key":"27_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York (1979)"},{"key":"27_CR11","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combin. 2, 191\u2013195 (1976)","journal-title":"Ars Combin."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2012.04.003","volume":"160","author":"L Hogben","year":"2012","unstructured":"Hogben, L., Huynh, M., Kingsley, N., Meyer, S., Walker, S., Young, M.: Propagation time for zero forcing on a graph. Discrete Appl. Math. 160, 1994\u20132005 (2012)","journal-title":"Discrete Appl. Math."},{"key":"27_CR13","first-page":"9","volume":"67","author":"CX Kang","year":"2013","unstructured":"Kang, C.X., Yi, E.: Probabilistic zero forcing in graphs. Bull. Inst. Combin. Appl. 67, 9\u201316 (2013)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-03780-6_8","volume-title":"Combinatorial Optimization and Applications","author":"CX Kang","year":"2013","unstructured":"Kang, C.X., Yi, E.: The fractional strong metric dimension of graphs. In: Widmayer, P., Xu, Y., Zhu, B. (eds.) COCOA 2013. LNCS, vol. 8287, pp. 84\u201395. Springer, Heidelberg (2013)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Appl. Math. 70, 217\u2013229 (1996)","journal-title":"Discrete Appl. Math."},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.dam.2006.06.009","volume":"155","author":"OR Oellermann","year":"2007","unstructured":"Oellermann, O.R., Peters-Fransen, J.: The strong metric dimension of graphs and digraphs. Discrete Appl. Math. 155, 356\u2013364 (2007)","journal-title":"Discrete Appl. Math."},{"key":"27_CR17","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, 4423\u20134432 (2012)","journal-title":"Linear Algebra Appl."},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/moor.1030.0070","volume":"29","author":"A Seb\u00f6","year":"2004","unstructured":"Seb\u00f6, A., Tannier, E.: On metric generators of graphs. Math. Oper. Res. 29, 383\u2013393 (2004)","journal-title":"Math. Oper. Res."},{"key":"27_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. 41, 482002 (2008)","journal-title":"J. Phys. A: Math. Theor."},{"key":"27_CR20","first-page":"549","volume":"14","author":"PJ Slater","year":"1975","unstructured":"Slater, P.J.: Leaves of trees. Congr. Numer. 14, 549\u2013559 (1975)","journal-title":"Congr. Numer."},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1007\/s10114-013-2365-z","volume":"29","author":"E Yi","year":"2013","unstructured":"Yi, E.: On strong metric dimension of graphs and their complements. Acta Math. Sin. (Engl. Ser.) 29, 1479\u20131492 (2013)","journal-title":"Acta Math. Sin. (Engl. Ser.)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:09:46Z","timestamp":1676419786000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}