Previous Issues
Volume :25 Issue : 1 1998
Add To Cart
Download
Characterization of parallel paths in arrangement graphs
Auther : KHALED DAY* AND ANAND TRIPATHI**
* Dept. of Computer Science, Sultan Qaboos University, OMAN
** Dept. of Computer Science, University of Minnesota, USA
ABSTRACT
In this paper we fully characterize node-disjoint (parallel) paths in arrangement graph inter-connection networks which have been presented as generalized star graphs for interconnecting large multiprocessor systems. We characterize complete families of parallel paths between any two nodes of an arrangement graph. The length of each path is at most four plus the minimum distance between the two nodes.