Arrangement graphs: a class of generalized star graphs

Khaled Day*, Anand Tripathi

*Corresponding author for this work

Research output: Contribution to journalArticle

131 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)235-241
Number of pages7
JournalInformation Processing Letters
Volume42
Issue number5
DOIs
Publication statusPublished - Jul 3 1992

Keywords

  • Fault tolerance
  • routing
  • star graphs
  • symmetry

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Arrangement graphs: a class of generalized star graphs'. Together they form a unique fingerprint.

  • Cite this