Progress towards the two-thirds conjecture on locating-total dominating sets

Dipayan Chakraborty, Florent Foucaud, Anni Hakanen +2

We study upper bounds on the size of optimum locating-total dominating sets in graphs. A set $S$ of vertices of a graph $G$ is a locating-total dominating set if every vertex of $G…