𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Orientations of the n-cube with minimum diameter

✍ Scribed by Joseph E. McCanna

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
368 KB
Volume
68
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

For n 3 4, the n-cube, Q,, is shown to have an orientation with diameter n.

πŸ“œ SIMILAR VOLUMES

Diameter-preserving orientations of the
Diameter-preserving orientations of the torus
✍ 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

Complexity of approximating the oriented
Complexity of approximating the oriented diameter of chordal graphs
✍ Fedor V. Fomin; MartΓ­n Matamala; Ivan Rapaport πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

## Abstract The oriented diameter of a bridgeless connected undirected (__bcu__) graph __G__ is the smallest diameter among all the diameters of strongly connected orientations of __G__. We study algorithmic aspects of determining the oriented diameter of a chordal graph. We (a) construct a linear‐