𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Diameter-preserving orientations of the torus

✍ Scribed by Konig, Jean-Claude; Krumme, David W.; Lazard, Emmanuel


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
138 KB
Volume
32
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis


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, except those whose sizes in both dimensions are odd. We also prove the impossibility of tightly orienting all the toroids for which we do not present tight orientations, and we give partial results for dimensionality higher than two.


πŸ“œ SIMILAR VOLUMES


Complexity of approximating the oriented
✍ 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‐

Re-envisioning the training and practice
✍ Joan M. Cook; James C. Coyne πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 61 KB πŸ‘ 1 views

## Abstract We argue for preservation of an expectation of psychologists that approach human problems from an evidence‐based perspective. Acquisition of the requisite knowledge, skills, and practical experience require access to resources outside of graduate psychology programs. Whether adhering to

On some minimal graphs of the torus
✍ R. Bodendiek; K. Wagner πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 259 KB πŸ‘ 1 views

## Let be the set of finite, simple and nondirected graphs being not embeddable into the torus. Furthermore let >4 be a partial order-relation and M, (r) the minimal basis of I'. In this paper we determine three graphs of M, (r) being embeddable into the projective plane and containing the subgrap

Grid Minors of Graphs on the Torus
✍ M. Degraaf; A. Schrijver πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 197 KB