19th IEEE International Parallel and Distributed Processing Symposium
DOI: 10.1109/ipdps.2005.223
|View full text |Cite
|
Sign up to set email alerts
|

Fault-Hamiltonicity of Hypercube-Like Interconnection Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 34 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…The n-dimensional parity cube (PQ ) has many features superior to those of Q . For example, the diameter of PQ is n + 1 /2" [6], which is about half that of Q for a sufficient large integer n. Since parity cube is a restricted hypercube-like network [7], accord to the results of [7,8], parity cubes can embed a Hamiltonian path(cycle), and PQ is n − 2 -hamiltonian and n − 3 -hamiltonian connected for any integer n ≥ 3. And meshes can be embedded into PQ [9].…”
Section: Introductionmentioning
confidence: 95%
“…The n-dimensional parity cube (PQ ) has many features superior to those of Q . For example, the diameter of PQ is n + 1 /2" [6], which is about half that of Q for a sufficient large integer n. Since parity cube is a restricted hypercube-like network [7], accord to the results of [7,8], parity cubes can embed a Hamiltonian path(cycle), and PQ is n − 2 -hamiltonian and n − 3 -hamiltonian connected for any integer n ≥ 3. And meshes can be embedded into PQ [9].…”
Section: Introductionmentioning
confidence: 95%