Title :
A comparative study of topological properties of hypercubes and star graphs
Author :
Day, Khaled ; Tripat, Anand
Author_Institution :
Dept. of Comput. Sci., Bahrain Univ., Isa Town, Bahrain
fDate :
1/1/1994 12:00:00 AM
Abstract :
Undertakes 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, the authors determine necessary and sufficient 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 proven of minimum length within a small additive constant. They 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 :
graph theory; hypercube networks; multiprocessor interconnection networks; network topology; asymptotically balanced; balanced spanning trees; comparative study; graph theory; greedy; hypercubes; interconnection network topologies; parallel paths; spanning trees; star graphs; Additives; Broadcasting; Computer science; Concurrent computing; Graph theory; Hypercubes; Multiprocessor interconnection networks; Network topology; Routing; Tree graphs;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
