In this short note, we prove that every twin-free graph on n vertices contains a locating-dominating set of size at most 5/8n. This improves the earlier bound of 2/3n due to Foucaud, Henning, L\"owenstein and Sasse from 2016, and makes some progress towards the well-studied locating-dominating conjecture of Garijo, Gonz\'alez and M\'arquez.
No takes yet. Share an insight, caveat, or question.
Bousquet et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: