On link-disjoint Hamiltonian cycles of torus networks
Seyed Milad Mir Latifi, S. Q. Zheng · 2002
The problem of embedding link disjoint Hamiltonian cycles into 2-D and 3-D torus networks is addressed. The maximum number of link-disjoint cycles is limited to half the degree of the node in a regular network. Simple methods are presented to embed the maximum number of such cycles in a 2-D and 3-D torus. An analysis of network fault-tolerance in the presence of a set of faulty links is also presented.>