Name
Abstract | ||
|---|---|---|
In this paper, we prove that the multiply-twisted hypercube is a Cayley graph and hence it possesses the desirable properties such as vertex symmetry, optimal fault tolerance, and small node degree. We also prove the conjecture that the 2n–1 node complete binary tree is a subgraph of the 2n node multiply twisted hypercube. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-58078-6_22 | Canada-France Conference on Parallel and Distributed Computing |
Keywords | Field | DocType |
multiply-twisted hypercube,binary tree,fault tolerant,cayley graph | Discrete mathematics,Combinatorics,Tree (graph theory),Vertex (geometry),Hypercube graph,Folded cube graph,Cayley graph,K-ary tree,Binary tree,Mathematics,Hypercube | Conference |
ISBN | Citations | PageRank |
3-540-58078-6 | 1 | 0.34 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Priyalal Kulasinghe | 1 | 78 | 8.72 |
| Saïd Bettayeb | 2 | 35 | 6.07 |