{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T20:13:45Z","timestamp":1784664825494,"version":"3.55.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,14]],"date-time":"2012-02-14T00:00:00Z","timestamp":1329177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00373-012-1136-4","type":"journal-article","created":{"date-parts":[[2012,2,13]],"date-time":"2012-02-13T10:40:13Z","timestamp":1329129613000},"page":"463-473","source":"Crossref","is-referenced-by-count":7,"title":["Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy\u2019s Theorem on Induced Subsets"],"prefix":"10.1007","volume":"29","author":[{"given":"Florent","family":"Foucaud","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reza","family":"Naserasr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aline","family":"Parreau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,2,14]]},"reference":[{"key":"1136_CR1","unstructured":"Babai, L., Frankl, P.: Linear algebra methods in combinatorics, preliminary version 2. Department of Computer Science, The University of Chicago (1992)"},{"key":"1136_CR2","unstructured":"Bertrand, N.: Codes identifiants et codes localisateurs-dominateurs sur certains graphes. Master thesis, ENST, Paris, France (2001)"},{"key":"1136_CR3","volume-title":"Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability","author":"B. Bollob\u00e1s","year":"1986","unstructured":"Bollob\u00e1s B.: Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability. Cambridge University Press, London (1986)"},{"issue":"2","key":"1136_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0095-8956(72)90025-1","volume":"12","author":"J.A. Bondy","year":"1972","unstructured":"Bondy J.A.: Induced subsets. J. Comb. Theory Ser. B 12(2), 201\u2013202 (1972)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"1136_CR5","first-page":"403","volume":"4","author":"I. Charon","year":"2008","unstructured":"Charon I., Cohen G., Hudry O., Lobstein A.: Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. Adv. Math. Commun. 4(2), 403\u2013420 (2008)","journal-title":"Adv. Math. Commun."},{"issue":"8","key":"1136_CR6","doi-asserted-by":"crossref","first-page":"1246","DOI":"10.1016\/j.dam.2005.11.007","volume":"154","author":"I. Charon","year":"2006","unstructured":"Charon I., Gravier S., Hudry O., Lobstein A., Mollard M., Moncel J.: A linear algorithm for minimum 1-identifying codes in oriented trees. Discrete Appl. Math. 154(8), 1246\u20131253 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"1136_CR7","doi-asserted-by":"crossref","first-page":"2192","DOI":"10.1109\/TIT.2002.800490","volume":"48","author":"I. Charon","year":"2002","unstructured":"Charon I., Hudry O., Lobstein A.: Identifying and locating-dominating codes: NP-completeness results for directed graphs. IEEE Trans. Inf. Theory 48(8), 2192\u20132200 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3\u20135","key":"1136_CR8","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.disc.2005.09.027","volume":"307","author":"I. Charon","year":"2007","unstructured":"Charon I., Hudry O., Lobstein A.: Extremal cardinalities for identifying and locating-dominating codes in graphs. Discrete Math. 307(3\u20135), 356\u2013366 (2007)","journal-title":"Discrete Math."},{"issue":"4","key":"1136_CR9","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1016\/j.ejc.2011.01.002","volume":"32","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. Comb. 32(4), 628\u2013638 (2011)","journal-title":"Eur. J. Comb."},{"issue":"3\u20135","key":"1136_CR10","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/j.disc.2005.09.035","volume":"307","author":"S. Gravier","year":"2007","unstructured":"Gravier S., Moncel J.: On graphs having a V\\{x} set as an identifying code. Discrete Math. 307(3\u20135), 432\u2013434 (2007)","journal-title":"Discrete Math."},{"key":"1136_CR11","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"M.G. 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, 599\u2013611 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1136_CR12","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L.: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)"},{"issue":"4","key":"1136_CR13","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1137\/0906067","volume":"6","author":"B.M.E. Moret","year":"1985","unstructured":"Moret B.M.E., Shapiro H.D.: On minimizing a set of tests. SIAM J. Sci. Stat. Comput. 6(4), 983\u20131003 (1985)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"1136_CR14","doi-asserted-by":"crossref","unstructured":"Ray, S., Ungrangsi, R., De Pellegrini, F., Trachtenberg, A., Starobinski, D.: Robust location detection in emergency sensor networks. In: Proceedings of the IEEE INFOCOM, pp. 1044\u20131053, April 2003","DOI":"10.1109\/INFCOM.2003.1208941"},{"key":"1136_CR15","first-page":"97","volume":"45","author":"P.J. Slater","year":"1984","unstructured":"Slater P.J., Rall D.F.: On location-domination numbers for certain classes of graphs. Congressus Numerantium 45, 97\u2013106 (1984)","journal-title":"Congressus Numerantium"},{"key":"1136_CR16","unstructured":"Skaggs, R.D.: Identifying vertices in graphs and digraphs. PhD thesis, University of South Africa, South Africa (2007). http:\/\/hdl.handle.net\/10500\/2226"},{"issue":"1","key":"1136_CR17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1006\/jcta.1999.3013","volume":"89","author":"A. Winter","year":"2000","unstructured":"Winter A.: Another algebraic proof of Bondy\u2019s theorem on induced subsets. J. Comb. Theory Ser. A 89(1), 145\u2013147 (2000)","journal-title":"J. Comb. Theory Ser. A"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1136-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1136-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1136-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T16:28:24Z","timestamp":1561307304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1136-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,14]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1136"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1136-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,14]]}}}