Diameter of parallelogramic honeycomb torus
โ Scribed by Xiaofan Yang; G.M. Megson; Yuanyan Tang; D.J. Evans
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 557 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
The determination of the diameter of an interconnection network is essential in evaluating the performance of the network. Parallelogramic honeycomb torus is an attractive alternative to classical torus network due to smaller vertex degree, and hence, lower implementation cost. In this paper, we present the expression for the diameter of a parallelogramic honeycomb torus, which extends a known result about rhombic honeycomb torus.
๐ SIMILAR VOLUMES
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