Diameter-preserving orientations of the
โ
Konig, Jean-Claude; Krumme, David W.; Lazard, Emmanuel
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 138 KB
The diameter of a directed graph is the maximum of the lengths of the shortest paths between all pairs of vertices. A directed graph is said to be tightly oriented if it has the same diameter as its undirected image graph. Our main result is tight orientations for all sufficiently large toroids, exc