Hamilton Paths and Cycles in Varietal Hypercube Networks with Mixed Faults

This paper considers the varietal hypercube network VQn with mixed faults and shows that VQn contains a fault-free Hamilton cycle provided faults do not exceed n-2 for n⩾2 and contains a fault-free Hamilton path between any pair of vertices provided faults do not exceed n-3 for n⩾3. The proof is based on an inductive construction.

A Hamilton Path Embedding Algorithm on DCell

DCell has been proposed for enormous data centers as a server centric interconnection which can support millions of servers with high network capacity and provide good fault tolerance by only using commodity switches. In this paper, we study an attractive algorithm of finding Hamilton paths in dimensional. The time complexity of this algorithm is , where is the node number of DCellk .