NETWORKS
2002
14 years 3 days ago
2002
NETWORKS
2002
14 years 3 days ago
2002
NETWORKS
2002
14 years 3 days ago
2002
An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thir...
NETWORKS
2002
14 years 3 days ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
NETWORKS
2002
14 years 3 days ago
2002
NETWORKS
2002
14 years 3 days ago
2002
NETWORKS
2002
14 years 3 days ago
2002
The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left ...
NETWORKS
2002
14 years 3 days ago
2002
NETWORKS
2002
14 years 3 days ago
2002
The n-dimensional augmented cube, denoted as AQn, a variation of the hypercube, possesses some properties superior to those of the hypercube. In this paper, we show that every ver...
NETWORKS
2002
14 years 3 days ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...