Locating-Domination and IdentificationChapter in: Topics in Domination in Graphs,
T. Haynes, S. Hedetniemi & M. Henning, Eds.,
pp. 251-299, Springer, 2020.
Antoine LOBSTEIN (*), Olivier HUDRY (#) & Irène CHARON (#)
(*) Centre National de la Recherche Scientifique, Laboratoire de Recherche en Informatique
(#) Télécom Paris, Institut polytechnique de Paris
lobstein@lri.fr, {charon, hudry}@enst.fr
Abstract. Locating-domination and identification are two particular, related, types of domination: a set C of vertices in a graph G=(V,E) is a locating-dominating code if it is dominating and any two vertices of V\C are dominated by distinct sets of codewords; C is an identifying code if it is dominating and any two vertices of V are dominated by distinct sets of codewords. This chapter presents a survey of the major results on locating-domination and on identification.