The arrangement graph A n,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. The structure of the arrangement graph is reviewed and some necessary definitions and notations are introduced. It is shown that Hamiltonian cycles exist in the arrangement graph even when there are edge or vertex faults.
|頁（從 - 到）||223-237|
|期刊||IEEE Transactions on Parallel and Distributed Systems|
|出版狀態||已出版 - 1999|