2018
DOI: 10.48550/arxiv.1811.09537
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On three domination numbers in block graphs

Aline Parreau,
Annegret K. Wagler

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 an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 17 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?