The advancement of large scale integrated circuit technology has enabled the construction
of complex interconnection networks. Graph theory provides a fundamental tool for …

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks
provides a number of advantages, including the increase of fault-tolerance, bandwidth and …

Minimum average congestion of enhanced and augmented hypercubes into complete binary
trees - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search …

Duo to its topological advantages, the enhanced hypercube network is a very important kind
of networks which has huge potential to be widely used in computer networks to improve the …

Graph embedding is an important technique that maps a guest graph into a host graph,
usually an interconnection network. Many applications can be modeled as graph …

A lot of research has been devoted to finding efficient embedding of trees into hypercubes.
On the other hand, in this paper, we consider the problem of embedding hypercubes into k …

Efficiency and reliable routing can be achieved by using internally node-disjoint paths
(disjoint path for short) because they can be used to avoid congestion, accelerate the …

The complete binary tree is an important network structure for parallel and distributed
computing, which has many nice properties and is often used to be embedded into other …

Let Qn, k (n≥ 3, 1≤ k≤ n− 1) be an n-dimensional enhanced hypercube which is an
attractive variant of the hypercube and can be obtained by adding some complementary …

The interconnection network considered in this paper is the folded hypercube that is an
attractive variance of the well-known hypercube. The folded hypercube is superior to the …