geodetic graphs; shortest paths; binary operations
In , the present author used a binary operation as a tool for characterizing geodetic graphs. In this paper a new proof of the main result of the paper cited above is presented. The new proof is shorter and simpler.
 G. Chartrand and L. Lesniak: Graphs & Digraphs. Third edition
. Chapman & Hall, London, 1996. MR 1408678
 L. Nebeský: A tree as a finite nonempty set with a binary operation
. Math. Bohem. 125 (2000), 455–458. MR 1802293