{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:40Z","timestamp":1759063480913},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,1,29]],"date-time":"2015-01-29T00:00:00Z","timestamp":1422489600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10878-015-9830-9","type":"journal-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T01:22:49Z","timestamp":1422408169000},"page":"1405-1416","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On identifying codes in the Cartesian product of a path and a complete graph"],"prefix":"10.1007","volume":"31","author":[{"given":"Jason","family":"Hedetniemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,29]]},"reference":[{"issue":"2","key":"9830_CR1","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"K Chakrabarty","year":"1998","unstructured":"Chakrabarty K, Karpovsky M, Levitin L (1998) On a new class of codes for identifying vertices in graphs. IEEE Trans Inform Theory 44(2):599\u2013611","journal-title":"IEEE Trans Inform Theory"},{"issue":"4","key":"9830_CR2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.37236\/2974","volume":"19","author":"M Feng","year":"2012","unstructured":"Feng M, Xu M, Wang K (2012) Identifying codes of lexicographic product of graphs. Electron J Comb 19(4):56\u201363","journal-title":"Electron J Comb"},{"key":"9830_CR3","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.dam.2013.12.017","volume":"169","author":"M Feng","year":"2014","unstructured":"Feng M, Wang K (2014) Identifying codes of corona product graphs. Discrete Appl Math 169:88\u201396","journal-title":"Discrete Appl Math"},{"key":"9830_CR4","first-page":"97","volume":"85","author":"W Goddard","year":"2013","unstructured":"Goddard W, Wash K (2013) ID codes in Cartesian products of cliques. J Comb Math Comb Comput 85:97\u2013106","journal-title":"J Comb Math Comb Comput"},{"key":"9830_CR5","doi-asserted-by":"crossref","unstructured":"Gravier S, Moncel J, Semri A (2008) Identifying codes of Cartesian product of two cliques of the same size. Electron J Comb 15(1): note 4","DOI":"10.37236\/879"},{"key":"9830_CR6","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of product graphs","author":"R Hammack","year":"2011","unstructured":"Hammack R, Imrich W, Klav\u017ear S (2011) Handbook of product graphs. CRC Press, Boca Raton"},{"key":"9830_CR7","first-page":"93","volume":"59","author":"J Kim","year":"2010","unstructured":"Kim J, Kim S (2010) Identifying codes in $$q$$ q -ary hypercubes. Bull Inst Comb Appl 59:93\u2013102","journal-title":"Bull Inst Comb Appl"},{"key":"9830_CR8","first-page":"81","volume":"41","author":"T Laihonen","year":"2008","unstructured":"Laihonen T, Moncel J (2008) On graphs admitting codes identifying sets of vertices. Australas J Comb 41:81\u201391","journal-title":"Australas J Comb"},{"key":"9830_CR9","unstructured":"Lobstein A (2014) Watching systems, identifying, locating-dominating and discriminating dodes in graphs. http:\/\/www.infres.enst.fr\/lobstein\/debutBIBidetlocdom . Accessed 28 October 2014"},{"issue":"6","key":"9830_CR10","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 (2006) Monotonicity of the minimum cardinality of an identifying code in the hypercube. Discrete Appl Math 154(6):898\u2013899","journal-title":"Discrete Appl Math"},{"key":"9830_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.ejc.2013.07.002","volume":"36","author":"D Rall","year":"2014","unstructured":"Rall D, Wash K (2014) Identifying codes of the direct product of two cliques. Eur J Comb 36:159\u2013171","journal-title":"Eur J Comb"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9830-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9830-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9830-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T11:09:36Z","timestamp":1598699376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9830-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,29]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9830"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9830-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,29]]}}}