On three domination numbers in block graphs - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

On three domination numbers in block graphs


The problems of determining minimum identifying, locating-dominating or open locating-dominating codes are special search problems that are challenging both from a theoretical and a computational point of view. Hence, a typical line of attack for these problems is to determine lower and upper bounds for minimum codes in special graphs. In this work we study the problem of determining the cardinality of minimum codes in block graphs (that are diamond-free chordal graphs). We present for all three codes lower and upper bounds as well as block graphs where these bounds are attained.
Fichier principal
Vignette du fichier
PW_hal.pdf (275.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01933492 , version 1 (23-11-2018)


  • HAL Id : hal-01933492 , version 1


Aline Parreau, Annegret K Wagler. On three domination numbers in block graphs. 2018. ⟨hal-01933492⟩
131 View
79 Download


Gmail Facebook Twitter LinkedIn More