Finite groups with geodetic Cayley graphs

Murray Elder, Adam Piggott, Florian Stober +2

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups…