๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Diameter-preserving orientations of the
โœ 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