Bounds and extremal graphs for monitoring edge-geodetic sets in graphs

Florent Foucaud, Clara Marcille, Zin Mar Myint +3

A monitoring edge-geodetic set, or simply an MEG-set, of a graph $G$ is a vertex subset $M\subseteq V(G)$ such that given any edge $e$ of $G$, $e$ lies on every shortest $u$-$v$ p…