Arrangement graphs

a class of generalized star graphs

Khaled Day, Anand Tripathi

Research output: Contribution to journalArticle

124 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

Fingerprint

Star Graph
Stars
Arrangement
Topology
Graph in graph theory
Vertex of a graph
Hierarchical Structure
Fault tolerance
Parameter Design
Fault Tolerance
Interconnection
Routing
Flexibility
Symmetry
Class
Generalization

Keywords

  • Fault tolerance
  • routing
  • star graphs
  • symmetry

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Arrangement graphs : a class of generalized star graphs. / Day, Khaled; Tripathi, Anand.

In: Information Processing Letters, Vol. 42, No. 5, 03.07.1992, p. 235-241.

Research output: Contribution to journalArticle

Day, Khaled ; Tripathi, Anand. / Arrangement graphs : a class of generalized star graphs. In: Information Processing Letters. 1992 ; Vol. 42, No. 5. pp. 235-241.
@article{4711664b9915454ab3161deb8e5085af,
title = "Arrangement graphs: a class of generalized star graphs",
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.",
keywords = "Fault tolerance, routing, star graphs, symmetry",
author = "Khaled Day and Anand Tripathi",
year = "1992",
month = "7",
day = "3",
doi = "10.1016/0020-0190(92)90030-Y",
language = "English",
volume = "42",
pages = "235--241",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "5",

}

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

VL - 42

SP - 235

EP - 241

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 5

ER -