超立方体与蜂窝矩形环托中圈与路嵌入.pdf

ii ℄ Æ ℄   ℄ ℄ n ( Q ) 2n n (honeycomb rectangular n torus, HReT(m, n)) (torus, ) 3 (1) () (2) HReT(m, n) HReT(m, n) (Hamiltonian-laceability) 1 3 2 3 HReT(m, n) 4 HReT(m, n) : ℄ Æ iii Abstract Graph embedding problem is one of the central issues in evaluating an inter- connection network, and the important benifit of this problem is that we can apply existing algorithms for guest graphs to host graphs. Rings and linear arrays are two fundamental networks in parallel processing and distributed computing due to thier low-cost communication. A network having Hamiltonian cycle or Hamiltonian path can efficiently simulate many algorithms designed on rings and linear arrays, so it is basic to have effective cycle or path embedding in designing network topologies. The link or node failures are inevitable when a large system is put in use, there- fore, fault-tolerent ability of an interconnection network is a critical issue in parallel computing. It is practical and important to research a system with failures. The hypercube and honeycomb rectangular torus are two common interconnec- tion networks. n−dimensional hypercube (denoted by Q ) is an n−regular bipar- n tite graph with 2n . A honeycomb rectangular torus (denoted by HReT (m, n)) is a 3−regular graphs, it is obtained from the torus (a network topology, that is, the Cartesian product of two circles) by deleting its some edges. Due to their many good topological properties, they hav