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 metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01933492
Contributor : Aline Parreau <>
Submitted on : Friday, November 23, 2018 - 5:21:01 PM
Last modification on : Monday, January 20, 2020 - 12:14:06 PM

Files

PW_hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01933492, version 1

Citation

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

Share

Metrics

Record views

121

Files downloads

43