Search Results

Independent spanning trees(ISTs) have increasing applications in fault-tolerance, reliable communication protocols and secure message distribution. In this paper, we propose an O(N) parallel algorithm to construct n BISTs rooted at any vertex on n-...

We derive a surface area result for the asymmetric twisted cube, provide closed-form expressions for such results in terms of some exemplary centers, and start to make an accurate analysis of its associated average distance measurement.

Twisted cubes are an important class of hypercube-variant interconnection networks for parallel computing. In this paper, we evaluate the fault-tolerant mesh/torus embedding abilities of twisted cubes. By reducing the fault-tolerant mesh/torus embedding ...

The dimensions of twisted cubes are only limited to odd integers. In this paper, we first extend the dimensions of twisted cubes to all positive integers. Then, we introduce the concept of the restricted faulty set into twisted cubes. We further prove ...

A graph G is pancyclic if, for every 4 ≤ l ≤ |V (G)|, G has a cycle of length l. A graph G is edge-pancyclic if, for an arbitrary edge e of G and every 4 ≤ l ≤ |V(G)|, G has a cycle of length l containing e. A graph G is node-pancyclic if, for an ...

The twisted cube TQn, is derived by changing some connection of hypercube Qn according to specific rules. Recently, many topological properties of this variation cube are studied. In this paper, we consider a faulty twisted n-cube with both edge and/or ...