| Summary: | 碩士 === 國立成功大學 === 資訊工程學系 === 102 === A graph G is said to be conditional k-edge-fault hamiltonian-connected if after removing k faulty edges from G, under the assumption that each node is incident to at least three fault-free edges, there exists a hamiltonian path between any two distinct nodes in the resulting graph. In this thesis, we consider the conditional edge-fault hamiltonian-connectivity of a wide class of interconnection networks, called restricted hypercube-like networks (RHLs). We proved that an n-dimensional RHL (RHLn) is conditional (2n-7)-edge-fault hamiltonian-connected for n 〉= 6. We then apply our technical theorems to show that several multiprocessor systems, including n-dimensional crossed cubes, n-dimensional twisted cubes for odd n, n-dimensional locally twisted cubes, n-dimensional generalized twisted cubes, n-dimensional Möbius cubes, and recursive circulants G(2^n, 4) for odd n, are all conditional (2n-7)-edge-fault hamiltonian-connected.
|
|---|
