A note on locating-dominating sets in twin-free graphs

Nicolas Bousquet, Quentin Chuet, Victor Falgas-Ravry +2

In this short note, we prove that every twin-free graph on $n$ vertices contains a locating-dominating set of size at most $\lceil \frac{5}{8}n\rceil$. This improves the earlier bou…