Delaunay graphs are almost as good as complete graphs
β Scribed by David P. Dobkin; Steven J. Friedman; Kenneth J. Supowit
- Publisher
- Springer
- Year
- 1990
- Tongue
- English
- Weight
- 425 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they allow for increased resource-sharing and communication bandwidth utilization, and they are especially suitable for optic
## Abstract A graph is __sβregular__ if its automorphism group acts freely and transitively on the set of __s__βarcs. An infinite family of cubic 1βregular graphs was constructed in [10], as cyclic coverings of the threeβdimensional Hypercube. In this paper, we classify the __s__βregular cyclic cov