Skip to Main content Skip to Navigation
Book sections

Locating-Domination and Identification

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.
Document type :
Book sections
Complete list of metadata
Contributor : Antoine Lobstein Connect in order to contact the contributor
Submitted on : Wednesday, July 7, 2021 - 4:10:00 PM
Last modification on : Sunday, June 26, 2022 - 3:10:46 AM
Long-term archiving on: : Friday, October 8, 2021 - 6:49:58 PM


Files produced by the author(s)


  • HAL Id : hal-02916929, version 1


Antoine Lobstein, Olivier Hudry, Irène Charon. Locating-Domination and Identification. T. Haynes, S. Hedetniemi & M. Henning. Topics in Domination in Graphs, pp.251-299, 2020. ⟨hal-02916929⟩



Record views


Files downloads