Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

On three domination numbers in block graphs

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Aline Parreau Connect in order to contact the contributor
Submitted on : Friday, November 23, 2018 - 5:21:01 PM
Last modification on : Monday, March 21, 2022 - 11:22:02 AM


Files produced by the author(s)


  • HAL Id : hal-01933492, version 1


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



Record views


Files downloads