Geodetic sets for directed acyclic planar geodetic graphs

Benedikt G. Hein, Egon Wanke

A set of vertices $S$ of a directed graph $G$ is geodetic if every vertex of $G$ lies on a shortest path from a vertex of $S$ to a vertex of $S$. A directed graph is geodetic if th…