38 search results - page 6 / 8 » Hamiltonian fault-tolerance of hypercubes |
JSAT
2008
13 years 7 months ago
2008
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
DM
2007
13 years 7 months ago
2007
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
Lee distance Gray codes for -ary Ò-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to directly generate edge disjoint Hamilto...
ENDM
2007
13 years 7 months ago
2007
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
ISPAN
2005
IEEE
14 years 28 days ago
2005
IEEE
