Geodesic graphs
| dc.contributor.author | Grinbergs, Emanuels | |
| dc.date.accessioned | 2013-12-17T14:24:06Z | |
| dc.date.accessioned | 2025-07-19T22:23:04Z | |
| dc.date.available | 2013-12-17T14:24:06Z | |
| dc.date.issued | 2013-12-17 | |
| dc.description.abstract | In the article, written in Russian, geodesic graphs, graphs with unique shortest path between every two vertices, are considered. Geodesic graphs are trees, odd cycles, and nontrivial example, the graph of Petersen. The article is dated 21.11.74. | en_US |
| dc.identifier.uri | https://dspace.lu.lv/handle/7/2179 | |
| dc.language.iso | rus | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | combinatorics, graph theory | en_US |
| dc.title | Geodesic graphs | en_US |
| dc.type | info:eu-repo/semantics/manuscript |