Extremal digraphs for open neighbourhood location-domination and identifying codes

Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani

A set $S$ of vertices of a digraph $D$ is called an open neighbourhood locating-dominating set if every vertex in $D$ has an in-neighbour in $S$, and for every pair $u,v$ of vertic…