The arrangement graph An,k, which is a generalization of the star graph (n-k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. Previously the arrangement graph has proven hamiltonian. In this paper the further show that the arrangement graph remains hamiltonian even if it is faulty. Let |Fe| and |Fv| denote the numbers of edge faults and vertex faults, respectively. We show that An,k is hamiltonian when (1) (k = 2 and n-k≥4, or k≥3 and n-k≥4+[k/2]), and |Fe|≤k(n-k)-2, or (2) k≥2, n-k≥2+[k/2], and |Fe|≤k(n-k-3)-1, or (3) k≥2, n-k≥3, and |Fe|≤k.
|出版狀態||已出版 - 1997|
|事件||Proceedings of the 1997 International Conference on Parallel and Distributed Systems - Seoul, South Korea|
持續時間: 10 12月 1997 → 13 12月 1997
|???event.eventtypes.event.conference???||Proceedings of the 1997 International Conference on Parallel and Distributed Systems|
|城市||Seoul, South Korea|
|期間||10/12/97 → 13/12/97|