CHARACTERIZATION OF PARALLEL PATHS IN ARRANGEMENT GRAPHS

Authors
DAY K TRIPATHI A
Citation
K. Day et A. Tripathi, CHARACTERIZATION OF PARALLEL PATHS IN ARRANGEMENT GRAPHS, Kuwait journal of science & engineering, 25(1), 1998, pp. 35-49
Citations number
27
Categorie Soggetti
Multidisciplinary Sciences
Journal title
Kuwait journal of science & engineering → ACNP
Volume
25
Issue
1
Year of publication
1998
Pages
35 - 49
Database
ISI
SICI code
Abstract
In this paper we fully characterize node-disjoint (parallel) paths in arrangement graph interconnection networks which have been presented a s generalized star graphs for interconnecting large multiprocessor sys tems. 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.