The growing complexity and dependability requirements of hardware, software, and
networks demand efficient techniques for discovering disruptive behavior in those systems …

The Mobius cubes are hypercube variants that give better performance with the same
number of links and processors. We show that the diameter of the Mobius cubes is about …

This paper introduces a new variant of the popular n-dimensional hypercube network Q n,
known as the n-dimensional locally twisted cube LTQ n, which has the same number of …

Following the recursive definition of the hypercube Qn, we define the augmented cube AQn.
After showing that its graph is vertex‐symmetric,(2n− 1)‐regular, and (2n− 1)‐connected and …

The twisted cube topology is a variant of the binary hypercube structure for multiprocessors,
with the same amount of hardware but a diameter of only (d+ 1)/2 in a cube of dimension d. It …

We introduce a class of graphs which are variants of the hypercube graph. Many of the
properties of this class of graphs are similar to that of the hypercube hence, we refer to them …

In this paper, we study diagnosabilities of multiprocessor systems under two diagnosis
models: the PMC model and the comparison model. In each model, we further consider two …

We propose a new topology for multicomputer networks, called recursive circulant.
Recursive circulant G (N, d) is defined to be a circulant graph with N nodes and jumps of …

The recently introduced interconnection network, crossed cube, has attracted much attention
in the parallel processing area due to its many attractive features. Like the ordinary …

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining
k distinct source-sink pairs in which each vertex of G is covered by a path. We deal with the …