Garijo, González and Márquez's location-domination conjecture for twin-free graphs

A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. For a graph $G$, a set $D$ of vertices locates a vertex $v\notin D$ if the neighborhood of $v$ within $D$ is unique among all vertices in $V(G)\setminus D$; a locating-dominating set is a dominating set that locates every vertex outside it. The location-domination number $\gamma_L(G)$ is the minimum cardinality of a locating-dominating set. The order of a graph is its number of vertices.

Garijo, González and Márquez's conjecture. There exists an integer $n_1$ such that for any $n\geq n_1$, the maximum value of the location-domination number of a connected twin-free graph of order $n$ is $\lfloor\frac{n}{2}\rfloor$.

This conjecture asserts that, for sufficiently large connected twin-free graphs, the location-domination number obeys the same one-half-order upper bound as the classical domination number. The source does not give evidence that it has been resolved.