A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set

Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1

A set $S$ of vertices in a graph $G$ is a dominating set of $G$ if every vertex not in $S$ has a neighbor in $S$, where two vertices are neighbors if they are adjacent. The dominat…