One more geodesic graph
Abstract
In this note, written in Latvian, a way to build geodesic graphs, graphs with
unique shortest path between every two vertices, is considered. Geodesic
graphs are trees, odd cycles, and nontrivial example, the graph of Petersen.
The article is dated 17.4.74.