Issue No. 01 - January (1994 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.262593
<p>Introduces a new interconnection network for massively parallel systems called theincomplete star graph. The authors describe unique ways of interconnecting and labelingthe nodes and routing point-to-point communications within this network. In addition,they provide an analysis of a special class of incomplete star graph called C/sup n/splminus/1/ graph and obtain the diameter and average distance for this network. For theC/sup n/spl minus/1/ graph, an efficient broadcasting scheme is presented. Furthermore,it is proven that a C/sup n/spl minus/1/ with N nodes (i.e. N=m(n/spl minus/1)!) isHamiltonian if m=4 or m=3k, and k/spl ne/2.</p>
Index Termsmultiprocessor interconnection networks; graph theory; network routing; interconnectionnetwork; massively parallel systems; star graph; incomplete star graph; incrementallyscalable network; interconnecting; labeling; point-to-point communications; C/sup n/splminus/1/ graph; Hamiltonian; Cayley graph; routing
S. Latifi and N. Bagherzadeh, "Incomplete Star: An Incrementally Scalable Network Based on the Star Graph," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 97-102, 1994.