Day, Khaled; Tripathi, Anand Characterization of parallel paths in arrangement graphs. (English) Zbl 0903.68004 Kuwait J. Sci. Eng. 25, No. 1, 35-49 (1998). Summary: We fully characterize node-disjoint (parallel) paths in arrangement graph interconnection 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. Cited in 3 Documents MSC: 68M07 Mathematical problems of computer architecture 68R10 Graph theory (including graph drawing) in computer science Keywords:interconnection networks; arrangement graph PDFBibTeX XMLCite \textit{K. Day} and \textit{A. Tripathi}, Kuwait J. Sci. Eng. 25, No. 1, 35--49 (1998; Zbl 0903.68004)