We say that a binary operation $*$ is associated with a (finite undirected) graph $G$ (without loops and multiple edges) if $*$ is defined on $V(G)$ and $uv\in E(G)$ if and only if $u\ne v$, $u * v=v$ and $v*u=u$ for any $u$, $v\in V(G)$. In the paper it is proved that a connected graph $G$ is geodetic if and only if there exists a binary operation associated with $G$ which fulfils a certain set of four axioms. (This characterization is obtained as an immediate consequence of a stronger result proved in the paper).
 M. Behzad, G. Chartrand and L. Lesniak-Foster: Graphs & Digraphs
. Prindle, Weber & Schmidt, Boston, 1979. MR 0525578
 L. Nebeský: A characterization of the set of all shortest paths in a connected graph
. Mathematica Bohemica 119 (1994), 15–20. MR 1303548
 L. Nebeský: A characterization of geodetic graphs
. Czechoslovak Math. Journal 45 (120) (1995), 491–493. MR 1344515