J. A. Bondy, Induced subsets, Journal of Combinatorial Theory, Series B, vol.12, issue.2, pp.201-202, 1972.
DOI : 10.1016/0095-8956(72)90025-1
URL : http://doi.org/10.1016/0095-8956(72)90025-1

N. Bertrand, Codes identifiants et codes localisateurs-dominateurs sur certains graphes, ENST, 2001.

N. Bertrand, I. Charon, O. Hudry, and A. Lobstein, Identifying and locating-dominating codes on chains and cycles, European Journal of Combinatorics, vol.25, issue.7, pp.969-987, 2004.
DOI : 10.1016/j.ejc.2003.12.013

N. Bertrand, I. Charon, and O. , Hudry and A. Lobstein. 1-identifying codes on trees, Australasian Journal of Combinatorics, vol.31, p.2135, 2005.

I. Charon, G. Cohen, O. Hudry, and A. Lobstein, Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity, Advances in Mathematics of Communications, pp.403-420, 2008.

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, Structural properties of twin-free graphs, Electronic Journal of Combinatorics, vol.14, issue.1, 2007.

I. Charon, O. Hudry, and A. Lobstein, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard, Theoretical Computer Science, vol.290, issue.3, pp.2109-2120, 2003.
DOI : 10.1016/S0304-3975(02)00536-4

I. Charon, O. Hudry, and A. Lobstein, Extremal cardinalities for identifying and locating-dominating codes in graphs, Discrete Mathematics, vol.307, issue.3-5, pp.3-5356, 2007.
DOI : 10.1016/j.disc.2005.09.027

G. Cohen, I. Honkala, A. Lobstein, and G. Zémor, On identifying codes, of Proceedings of the DIMACS Workshop on Codes and Association Schemes '99, pp.97-109, 2001.
DOI : 10.1090/dimacs/056/07

F. Foucaud, Identifying codes in special graph classes, 2009.

S. Gravier and J. Moncel, On graphs having a <mml:math altimg="si3.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>V</mml:mi><mml:mo>???</mml:mo><mml:mo stretchy="false">{</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">}</mml:mo></mml:math> set as an identifying code, Discrete Mathematics, vol.307, issue.3-5, pp.432-434, 2007.
DOI : 10.1016/j.disc.2005.09.035

T. W. Haynes, D. J. Knisley, E. Seier, and Y. Zou, A quantitative analysis of secondary RNA structure using domination based parameters on trees, BMC Bioinformatics, vol.7, issue.1, p.108, 2006.
DOI : 10.1186/1471-2105-7-108

M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Transactions on Information Theory, vol.44, issue.2, pp.599-611, 1998.
DOI : 10.1109/18.661507

M. Laifenfeld, A. Trachtenberg, R. Cohen, and D. Starobinski, Joint monitoring and routing in wireless sensor networks using robust identifying codes, Proceedings of IEEE Broadnets, pp.197-206, 2007.

R. Motwani and M. Sudan, Computing roots of graphs is hard, Discrete Applied Mathematics, vol.54, issue.1, pp.81-88, 1994.
DOI : 10.1016/0166-218X(94)00023-9

S. Ray, R. Ungrangsi, F. De-pellegrini, A. Trachtenberg, and D. Starobinski, Robust location detection in emergency sensor networks, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), pp.1044-1053, 2003.
DOI : 10.1109/INFCOM.2003.1208941

R. D. Skaggs, Identifying vertices in graphs and digraphs, 2007.

P. J. Slater, Dominating and reference sets in a graph, Journal of Mathematical and Physical Sciences, vol.22, issue.4, pp.445-455, 1988.

P. J. Slater and D. F. , On location-domination numbers for certain classes of graphs, Congressus Numerantium, vol.45, pp.97-106, 1984.