𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding the diameter of a set of lines

✍ Scribed by Y.T. Ching; D.T. Lee

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
437 KB
Volume
18
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimal Diameter of Certain Sets in the
Minimal Diameter of Certain Sets in the Plane
✍ AndrΓ‘s Bezdek; Ferenc Fodor πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 91 KB

We investigate the problem of finding the smallest diameter D(n) of a set of n points such that all the mutual distances between them are at least 1. The asymptotic behaviour of D(n) is known; the exact value of D(n) can be easily found up to 6 points. Bateman and Erdo s proved that D(7)=2. In this

On the ErdΕ‘s-diameter of sets
On the ErdΕ‘s-diameter of sets
✍ Peter Brass πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 224 KB
Diameter vulnerability of iterated line
Diameter vulnerability of iterated line digraphs
✍ C. PadrΓ³; P. Morillo πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 823 KB

Because of their good properties, iterated line digraphs (specially Kautz and de Bruijn digraphs) have been considered to design interconnection networks. The diameter-vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a fixed number of vertices or arcs. For a

A distinct distance set of 9 nodes in a
A distinct distance set of 9 nodes in a tree of diameter 36
✍ Herbert Taylor πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 151 KB

Taylor, H., A distinct distance set of 9 nodes in a tree of diameter 36, Discrete Mathematics 93 (1991) 167-168.