Geodetic orientations of complete k-partite graphs |
| |
| Authors: | Larry D Gassman RC Entringer John R Gilbert Stephen A Lonz Wayne Vucenic |
| |
| Institution: | University of New Mexico, Albuquerque, New Mexico 87131 USA |
| |
| Abstract: | Ore defined a graph to be geodetic if and only if there is a unique shortest path between two points, and posed the problem of characterizing such graphs. Here this problem is studied in the context of oriented graphs and such geodetic orientations are characterized first for complete graphs (geodetic tournaments), then for complete bipartite and complete tripartite graphs, and finally for complete k-partite graphs. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
