TY - JOUR
T1 - Arrangement graphs
T2 - a class of generalized star graphs
AU - Day, Khaled
AU - Tripathi, Anand
PY - 1992/7/3
Y1 - 1992/7/3
N2 - We present a new interconnection topology, called the arrangement graph, as a generalization of the star graph topology and prove many of its properties such as: hierarchical structure, vertex and edge symmetry, simple and optimal routing, and many fault tolerance properties. The arrangement graph presents more flexibility than the star graph in terms of choosing the major design parameters: degree, diameter, and number of nodes.
AB - We present a new interconnection topology, called the arrangement graph, as a generalization of the star graph topology and prove many of its properties such as: hierarchical structure, vertex and edge symmetry, simple and optimal routing, and many fault tolerance properties. The arrangement graph presents more flexibility than the star graph in terms of choosing the major design parameters: degree, diameter, and number of nodes.
KW - Fault tolerance
KW - routing
KW - star graphs
KW - symmetry
UR - http://www.scopus.com/inward/record.url?scp=0000842618&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0000842618&partnerID=8YFLogxK
U2 - 10.1016/0020-0190(92)90030-Y
DO - 10.1016/0020-0190(92)90030-Y
M3 - Article
AN - SCOPUS:0000842618
SN - 0020-0190
VL - 42
SP - 235
EP - 241
JO - Information Processing Letters
JF - Information Processing Letters
IS - 5
ER -