{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:11:55Z","timestamp":1758823915232,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T00:00:00Z","timestamp":1495756800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["209654"],"award-info":[{"award-number":["209654"]}],"id":[{"id":"10.13039\/100000893","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":[[2017,7]]},"DOI":"10.1007\/s00373-017-1813-4","type":"journal-article","created":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T11:18:41Z","timestamp":1495797521000},"page":"1037-1053","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Minimum Identifying Codes in Some Cartesian Product Graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"D. F.","family":"Rall","sequence":"first","affiliation":[]},{"given":"K.","family":"Wash","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,26]]},"reference":[{"issue":"1","key":"1813_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1137\/S0895480104444089","volume":"19","author":"Y Ben-Haim","year":"2005","unstructured":"Ben-Haim, Y., Litsyn, S.: Exact minimum density of codes identifying vertices in the square grid. SIAM J. Discr. Math. 19(1), 69\u201382 (2005). (electronic)","journal-title":"SIAM J. Discr. Math."},{"issue":"2","key":"1813_CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S","volume":"8","author":"U Blassm","year":"2000","unstructured":"Blassm, U., Honkala, I., Litsyn, S.: On binary codes for identification. J. Combin. Des. 8(2), 151\u2013156 (2000)","journal-title":"J. Combin. Des."},{"key":"1813_CR3","doi-asserted-by":"crossref","unstructured":"Cohen, G., Honkala, I., Mollard, M., Gravier, S., Lobstein, A., Payan, C., Z\u00e9mor, G.: Improves identifying codes for the grid. Electron. J. Combin. 6 Research Paper 19, p. 3 (1999). (electronic)","DOI":"10.37236\/1451"},{"issue":"2","key":"1813_CR4","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1016\/j.ejc.2011.01.002","volume":"4","author":"F Foucaud","year":"2011","unstructured":"Foucaud, F., Guerrini, E., Kov\u0161e, M., Naserasr, R., Parreau, A., Valicov, P.: Extremal graphs for the identifying code problem. Eur. J. Combin. 4(2), 628\u2013638 (2011)","journal-title":"Eur. J. Combin."},{"key":"1813_CR5","first-page":"97","volume":"85","author":"W Goddard","year":"2013","unstructured":"Goddard, W., Wash, K.: ID codes in Cartesian products of cliques. J. Combin. Math. Combin. Comput. 85, 97\u2013106 (2013)","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"3","key":"1813_CR6","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1137\/11082574","volume":"25","author":"D Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, D., Pinlou, A., Rao, M., Thomass\u00e9, S.: The domination number of grids. SIAM J. Discr. Math. 25(3), 1443\u20131453 (2011)","journal-title":"SIAM J. Discr. Math."},{"issue":"1","key":"1813_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.37236\/879","volume":"15","author":"S Gravier","year":"2008","unstructured":"Gravier, S., Moncel, J., Semri, A.: Identifying codes of Cartesian product of two cliques of the same size. Electron. J. Combin. 15(1), 7 (2008). (Note 4)","journal-title":"Electron. J. Combin."},{"key":"1813_CR8","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs Discrete Mathematics and its Applications","author":"R Hammack","year":"2011","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of Product Graphs Discrete Mathematics and its Applications. CRC Press, Boca Raton, FL (2011)"},{"issue":"3","key":"1813_CR9","doi-asserted-by":"crossref","first-page":"389","DOI":"10.7151\/dmgt.1238","volume":"24","author":"BL Hartnell","year":"2004","unstructured":"Hartnell, B.L., Rall, D.F.: On dominating the Cartesian product of a graph and $$K_2$$ K 2 . Discuss. Math. Graph Theory 24(3), 389\u2013402 (2004)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1813_CR10","doi-asserted-by":"publisher","unstructured":"Hedetniemi, J.: On identifying codes in the Cartesian product of a path and a complete graph. J. Comb. Optim. (2015). doi: 10.1007\/s10878-015-9830-9","DOI":"10.1007\/s10878-015-9830-9"},{"issue":"2","key":"1813_CR11","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/S0097539703433110","volume":"33","author":"I Honkala","year":"2004","unstructured":"Honkala, I., Laihonen, T.: On identifying codes in the triangular and square grids. SIAM J. Comput. 33(2), 304\u2013312 (2004). (electronic)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1813_CR12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1006\/jcta.2002.3263","volume":"99","author":"I Honkala","year":"2002","unstructured":"Honkala, I., Lobstein, A.: On identifying codes in binary Hamming spaces. J. Combin. Theory Ser. A 99(2), 232\u2013243 (2002)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1813_CR13","doi-asserted-by":"crossref","DOI":"10.1201\/b10613","volume-title":"Topics in Graph Theory: Graphs and Their Cartesian Product","author":"W Imrich","year":"2008","unstructured":"Imrich, W., Klav\u017ear, S., Rall, D.F.: Topics in Graph Theory: Graphs and Their Cartesian Product. A K Peters, Wellesley, MA (2008)"},{"issue":"5","key":"1813_CR14","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1016\/j.jcta.2009.02.004","volume":"116","author":"S Janson","year":"2009","unstructured":"Janson, S., Laihonen, T.: On the size of identifying codes in binary hypercubes. J. Combin. Theory Ser. A 116(5), 1087\u20131096 (2009)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"1813_CR15","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44(2), 599\u2013611 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1813_CR16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0020-0190(98)00199-9","volume":"69","author":"MG Karpovsky","year":"1999","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitiin, L.B., Avresky, D.R.: On the covering of vertices for fault diagnosis in hypercubes. Inform. Process. Lett. 69(2), 99\u2013103 (1999)","journal-title":"Inform. Process. Lett."},{"key":"1813_CR17","unstructured":"Lobstein, A.: http:\/\/www.infres.enst.fr\/lobstein\/debutbibidetlocdom.pdf . Accessed 2 Oct 2016"},{"key":"1813_CR18","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.ejc.2013.07.002","volume":"36","author":"DF Rall","year":"2014","unstructured":"Rall, D.F., Wash, K.: Identifying codes in the direct product of two cliques. Eur. J. Comb. 36, 159\u2013171 (2014)","journal-title":"Eur. J. Comb."},{"issue":"6","key":"1813_CR19","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1016\/j.dam.2005.05.030","volume":"154","author":"J Moncel","year":"2006","unstructured":"Moncel, J.: Monotonicity of the minimum cardinality of an identifying code in the hypercube. Discr. Appl. Math. 154(6), 898\u2013899 (2006)","journal-title":"Discr. Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1813-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1813-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1813-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T17:06:41Z","timestamp":1602176801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1813-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,26]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1813"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1813-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,5,26]]}}}