The Twisted-Cube Connected Networks

Journal of Computer Science and Technology

Volumn 14, Issue 2, 1999, Pages 181-187

  Wang, Deqiang ^a   Zhao, Lianchang ^a  

^a DALIAN MARITIME UNIVERSITY   (China)

Author keywords

Connectivity; Hypercube; Interconnection network; Routing algorithm

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY;

TWISTED-CUBE CONNECTED NETWORKS;

INTERCONNECTION NETWORKS;

EID: 0033099485     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02946526     Document Type: Article

References (9)

1. Saad Y, Schultz M H. Topological properties of hypercube. IEEE Trans. Comput., 1988, 37(7): 867-872.
2. Esfahanian A H. Generalized measures of fault tolerance with application to n-cube networks. IEEE Trans. Computers, 1989, 38(11): 1586-1590.
3. Esfahanian A H, Ni L M, Sagan B E. The twisted N-cube with application to multiprocessing. IEEE Trans. Computers, 1991, 40(1): 88-93.
4. Cull P, Larson S M. The Möbius cubes. IEEE Trans. Computers, 1995, 44(5): 647-659.
5. Efe K. A variation on the hypercube with lower diameter. IEEE Trans. Computers, 1991, 40(11): 1312-1316.
6. Efe K. The crossed cube architecture for parallel computation. IEEE Trans. Parallel and Distributed Systems, 1992, 3(5): 513-524.
7. Kulasinghe P, Bettayeb S. Embedding binary trees into crossed cubes. IEEE Trans. Computers, 1995, 44(7): 923-929.
8. Bondy J A, Murty U S R. Graph Theory with Applications. The Macmillan Press Ltd., 1976.
9. Katseff H P. Incomplete hypercubes. IEEE Trans. Computers, 1988, 37(5): 647-659.