On the double-vertex-cycle-connectivity of crossed cubes

Parallel Algorithms and Applications

Volumn 19, Issue 1, 2004, Pages 11-17

  Yang, Xiaofan ^a   Megson, Graham M ^b  

^a CHONGQING UNIVERSITY   (China)

^b UNIVERSITY OF READING   (United Kingdom)

Author keywords

Crossed cube; Double vertex cycle connectivity; Hypercube; Interconnection network

Indexed keywords

COMPUTATIONAL METHODS; CONFORMAL MAPPING; DATA COMMUNICATION SYSTEMS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; SET THEORY;

CROSSED CUBES; DOUBLE-VERTEX-CYCLE-CONNECTIVITY; HYPERCUBES;

INTERCONNECTION NETWORKS;

EID: 2342437375     PISSN: 10637192     EISSN: None     Source Type: Journal    
DOI: 10.1080/1063719042000208836     Document Type: Article

References (13)

1. Agrawal, N. and Ravikumar, C. (1996) "Fault-tolerant routing in multiply twisted cube topology", Journal of Systems Architecture 42, 279-288.
2. Chang, C., Sung, T. and Hsu, L. (2000) "Edge congestion and topological properties of crossed cubes", IEEE Transactions on Parallel Distributed Systems 1(11), 64-80.
3. Efe, K. (1992) "The crossed cube architecture for parallel computation", IEEE Transactions on Parallel Distributed Systems 5(3), 513-524.
4. Fan, J. (1998) "Diagnosability of crossed cubes under the two strategies", Chinese Journal of Computers 5(21), 456-462.
5. Fan, J. (2002) "Diagnosability of crossed cubes under the comparison diagnosis model", IEEE Transactions on Parallel Distributed Systems 7(13), 687-692.
6. Harary, F. (1969) Graph Theory (Addison-Wesley, Reading).
7. Horiguchi, S. and Konuki, M. (2001) "Exact mean distance of crossed cube interconnection network", Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1719-1725.
8. Huang, W., Chuang, Y., Tan, J. and Hsu, L. (2002) "On the fault-tolerant hamiltonicity of faulty crossed cubes", IEICE Transactions on Fundamentals 6(E85-A), 1359-1370.
9. Huang, W. and Chen, W. (2002) "On the fault-tolerant pancycticity of crossed cubes", Proceedings of the 9th International Conference on Parallel Distributed Systems.
10. Kulasinghe, P. (1997) "Connectivity of the crossed cube", Information Processing Letters 61, 221-226.
11. Kulasinghe, P. and Bettayeb, S. (1995) "Embedding binary trees into crossed cubes", IEEE Transactions on Computers 7(44), 923-929.
12. Parhami, B. (1999) An Introduction to Parallel Processing: Algorithms and Architectures (Plenum Press, New York).
13. Yang, X. and Megson, G. (2004) "On the path-connectivity, vertex-pancyclicity, and edge-pancyclicity of crossed cubes", International Journal of Computer Mathematics, submitted.