Monitoring the edges of a graph using distances

Florent Foucaud, Shih-Shun Kao, Ralf Klasing +2

We introduce a new graph-theoretic concept in the area of network monitoring. A set $M$ of vertices of a graph $G$ is a \emph{distance-edge-monitoring set} if for every edge $e$ of…