A Comparative Study of Topological Properties of Hypercubes and Star Graphs

Research output: Contribution to journalArticle

168 Citations (Scopus)

Abstract

In this paper, we undertake a comparative study of two important interconnection network topologies: the star graph and the hypercube, from the graph theory point of view. Topological properties are derived for the star graph and are compared with the corresponding properties of the hypercube. Among other results, we determine necessary and sufficient conditions for shortest path routing and we characterize maximum-sized families of parallel paths between any two nodes of the star graph. These parallel paths are proven of minimum length within a small additive constant. We also define greedy and asymptotically balanced spanning trees to support broadcasting and personalized communication on the star graph. These results confirm the already claimed topological superiority of the star graph over the hypercube.

Original languageEnglish
Pages (from-to)31-38
Number of pages8
JournalIEEE Transactions on Parallel and Distributed Systems
Volume5
Issue number1
DOIs
Publication statusPublished - 1994

Fingerprint

Star Graph
Topological Properties
Hypercube
Stars
Comparative Study
Path
Graph theory
Interconnection Networks
Broadcasting
Spanning tree
Network Topology
Shortest path
Routing
Topology
Necessary Conditions
Sufficient Conditions
Communication
Vertex of a graph

Keywords

  • Balanced trees hypercubes parallel paths routing spanning trees star graphs topology
  • Index Terms

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering
  • Theoretical Computer Science

Cite this

@article{c33f328856b8419fa72a6f9074b61bb1,
title = "A Comparative Study of Topological Properties of Hypercubes and Star Graphs",
abstract = "In this paper, we undertake a comparative study of two important interconnection network topologies: the star graph and the hypercube, from the graph theory point of view. Topological properties are derived for the star graph and are compared with the corresponding properties of the hypercube. Among other results, we determine necessary and sufficient conditions for shortest path routing and we characterize maximum-sized families of parallel paths between any two nodes of the star graph. These parallel paths are proven of minimum length within a small additive constant. We also define greedy and asymptotically balanced spanning trees to support broadcasting and personalized communication on the star graph. These results confirm the already claimed topological superiority of the star graph over the hypercube.",
keywords = "Balanced trees hypercubes parallel paths routing spanning trees star graphs topology, Index Terms",
author = "Khaled Day",
year = "1994",
doi = "10.1109/71.262586",
language = "English",
volume = "5",
pages = "31--38",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "1",

}

TY - JOUR

T1 - A Comparative Study of Topological Properties of Hypercubes and Star Graphs

AU - Day, Khaled

PY - 1994

Y1 - 1994

N2 - In this paper, we undertake a comparative study of two important interconnection network topologies: the star graph and the hypercube, from the graph theory point of view. Topological properties are derived for the star graph and are compared with the corresponding properties of the hypercube. Among other results, we determine necessary and sufficient conditions for shortest path routing and we characterize maximum-sized families of parallel paths between any two nodes of the star graph. These parallel paths are proven of minimum length within a small additive constant. We also define greedy and asymptotically balanced spanning trees to support broadcasting and personalized communication on the star graph. These results confirm the already claimed topological superiority of the star graph over the hypercube.

AB - In this paper, we undertake a comparative study of two important interconnection network topologies: the star graph and the hypercube, from the graph theory point of view. Topological properties are derived for the star graph and are compared with the corresponding properties of the hypercube. Among other results, we determine necessary and sufficient conditions for shortest path routing and we characterize maximum-sized families of parallel paths between any two nodes of the star graph. These parallel paths are proven of minimum length within a small additive constant. We also define greedy and asymptotically balanced spanning trees to support broadcasting and personalized communication on the star graph. These results confirm the already claimed topological superiority of the star graph over the hypercube.

KW - Balanced trees hypercubes parallel paths routing spanning trees star graphs topology

KW - Index Terms

UR - http://www.scopus.com/inward/record.url?scp=0028282199&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028282199&partnerID=8YFLogxK

U2 - 10.1109/71.262586

DO - 10.1109/71.262586

M3 - Article

VL - 5

SP - 31

EP - 38

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 1

ER -