A Comparative Study of Topological Properties of Hypercubes and Star Graphs

Research output: Contribution to journalArticlepeer-review

183 Citations (Scopus)


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
Issue number1
Publication statusPublished - Jan 1994
Externally publishedYes


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

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'A Comparative Study of Topological Properties of Hypercubes and Star Graphs'. Together they form a unique fingerprint.

Cite this