Incomplete star - an incrementally scalable network-based on the star graph

Document Type



Introduces a new interconnection network for massively parallel systems called the incomplete star graph. The authors describe unique ways of interconnecting and labeling the 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 n-1 graph and obtain the diameter and average distance for this network. For the Cn-1 graph, an efficient broadcasting scheme is presented. Furthermore, it is proven that a Cn-1with N nodes (i.e. N=m(n-1)!) is Hamiltonian if m=4 or m=3k, and k≠2


Cayley graphs; Computer algorithms; Graph theory; Hamiltonian graph theory; Hypercube networks (Computer networks); Parallel computers; Routing (Computer network management)


Computer and Systems Architecture | Digital Communications and Networking | Electrical and Computer Engineering | Engineering | Signal Processing | Systems and Communications


Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

UNLV article access

Search your library