Combinatorial properties of generalized hypercube graphs

Information Processing Letters

Volumn 57, Issue 1, 1996, Pages 41-45

  Duh, Dyi Rong ^a   Chen, Gen Huey ^a   Hsu, D Frank ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b FORDHAM UNIVERSITY   (United States)

Author keywords

Algorithms; Graph theory

Indexed keywords

EID: 0003122149     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(95)00173-5     Document Type: Article

References (8)

1. L.N. Bhuyan and D.P. Agrawal, Generalized hypercube and hyperbus structures for a computer network, IEEE Trans. Comput. 33 (1984) 323-333.
2. F. Buckley and F. Harary, Distance in Graphs (Addison-Wesley, Reading, MA, 1990).
3. G.H. Chen and D.R. Duh, Topological properties, communication, and computation on WK-recursive networks, Networks 24 (1994) 303-317.
4. W.J. Dally, Performance analysis of k-ary n-cube interconnection networks, IEEE Trans. Comput. 39 (1990) 775-785.
5. D.F. Hsu, On container width and length in graphs, groups, and networks, IEICE Trans. Fundamentals E77-A (1994) 668-680.
6. M.S. Krishnamoorthy and B. Krishnamurthy, Fault diameter of interconnection networks, Comput. Math. Appl. 13 (1987) 577-582.
7. Y. Saad and M.H. Schultz, Topological properties of hypercubes, IEEE Trans. Comput. 37 (1988) 867-872.
8. S.B. Tien and C.S. Raghavendra, Algorithms and bounds for shortest paths and diameter in faulty hypercubes, IEEE Trans. Parallel Distributed Systems 4 (1993) 713-718.