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

I. Charon, I. Honkala, and O. Hudry, Minimum sizes of identifying codes in graphs differing by one vertex, Cryptography and Communications, vol.29, issue.1, pp.119-136, 2013.
DOI : 10.1007/s12095-012-0078-2

URL : https://hal.archives-ouvertes.fr/hal-00731811

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, Structural Properties of Twin-Free Graphs, Electronic Journal of Combinatorics, vol.14, issue.1, p.16, 2007.

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.356-366, 2007.
DOI : 10.1016/j.disc.2005.09.027

F. Foucaud, E. Guerrini, M. Kovse, R. Naserasr, A. Parreau et al., Extremal graphs for the identifying code problem, European Journal of Combinatorics, vol.32, issue.4, pp.628-638, 2011.
DOI : 10.1016/j.ejc.2011.01.002

URL : https://hal.archives-ouvertes.fr/hal-00477467

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, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in graphs, 1998.

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.44-599, 1998.
DOI : 10.1109/18.661507

A. Lobstein, Watching systems, identifying, locating-dominating and discriminating codes in graphs, Bibliography

P. J. Slater, Domination and location in acyclic graphs, Networks, pp.55-64, 1987.

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