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.
|Number of pages||15|
|Journal||IEEE Transactions on Parallel and Distributed Systems|
|Publication status||Published - 1999 Jan 1|
All Science Journal Classification (ASJC) codes
- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics