Locating-Domination and Identification
Résumé
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.
Domaines
Mathématiques [math]
Origine : Fichiers produits par l'(les) auteur(s)