Issue No. 01 - January (1994 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.262586
<p>Undertakes a comparative study of two important interconnection network topologies:the star graph and the hypercube, from the graph theory point of view. Topologicalproperties are derived for the star graph and are compared with the correspondingproperties of the hypercube. Among other results, the authors determine necessary andsufficient conditions for shortest path routing and characterize maximum-sized families of parallel paths between any two nodes of the star graph. These parallel paths are provenof minimum length within a small additive constant. They also define greedy andasymptotically balanced spanning trees to support broadcasting and personalizedcommunication on the star graph. These results confirm the already claimed topologicalsuperiority of the star graph over the hypercube.</p>
Index Termshypercube networks; graph theory; multiprocessor interconnection networks; networktopology; hypercubes; star graphs; interconnection network topologies; comparativestudy; graph theory; parallel paths; spanning trees; greedy; asymptotically balanced;balanced spanning trees
A. Tripathi and K. Day, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 31-38, 1994.