A note on locating-dominating sets in twin-free graphs
Nicolás Bousquet, Quentin Chuet, Victor Falgas‐Ravry, Amaury Jacques, Laure Morelle · Discrete Mathematics · 2024
In this short note, we prove that every twin-free graph on n vertices contains a locating-dominating set of size at most . This improves the earlier bound of due to Foucaud, Henning, Löwenstein and Sasse from 2016, and makes some progress towards the well-studied locating-dominating conjecture of Garijo, González and Márquez.