One more geodesic graph
| dc.contributor.author | Grinbergs, Emanuels | |
| dc.date.accessioned | 2013-12-17T14:26:15Z | |
| dc.date.available | 2013-12-17T14:26:15Z | |
| dc.date.issued | 2013-12-17 | |
| dc.description.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. | en_US |
| dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/2180 | |
| dc.language.iso | lav | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.title | One more geodesic graph | en_US |
| dc.type | info:eu-repo/semantics/manuscript | en_US |