On global location-domination in graphs

C. Hernando, M. Mora, I. M. Pelayo

A dominating set $S$ of a graph $G$ is called locating-dominating, LD-set for short, if every vertex $v$ not in $S$ is uniquely determined by the set of neighbors of $v$ belonging…