geodetic graphs; connected graph; shortest paths
Let $G$ be a (finite undirected) connected graph (with no loop or multiple edge). The set $\Cal L$ of all shortest paths in $G$ is defined as the set of all paths $\xi$, then the lenght of $\xi$ does not exceed the length of $\varsigma$. While the definition of $\Cal L$ is based on determining the length of a path. Theorem 1 gives - metaphorically speaking - an "almost non-metric" characterization of $\Cal L$: a characterization in which the length of a path greater than one is not considered. Two other theorems are derived from Theorem 1. One of them (Theorem 3) gives a characterization of geodetic graphs.
 M. Behzad G. Chartrand, L. Lesniak-Foster: Graphs & Digraphs
. Prindle, Weber & Schmidt, Boston, 1979. MR 0525578
 L. Nebeský: Route systems and bipartite graphs
. Czechoslovak Math. Journal 41 (116) (1991), 260-264. MR 1105440