Topological Properties of Hypercubes
IEEE Transactions on Computers
Analysis of interconnection networks based on Cayley graphs related to permutation groups
Analysis of interconnection networks based on Cayley graphs related to permutation groups
Trivalent Cayley graphs for interconnection networks
Information Processing Letters
Shortest routing in trivalent Cayley graph network
Information Processing Letters
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
IEEE Transactions on Parallel and Distributed Systems
One-to-all broadcast algorithm for constant degree 4 Cayley graphs
Parallel Computing
A New Fixed Degree Regular Network for Parallel Processing
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
| Hi-index | 0.00 |
In the past years, various network architectures for parallelcomputers have been proposed, for example, hyper cubes or stargraphs. These classes of networks are known as Cayley graphs. Inrecent years, there have been some proposals of new families ofinterconnection networks, namely, constant degree networks. In thispaper, a new interconnection network named extended star graphs isproposed, and it is proved that the extended star graphs havehypercube structure. We also provide a routing algorithm fornode-to-node communication on extended star graphs. Based on thealgorithm, we obtain an upper bound 2n-1 on the diameter for then-th order extended star graph.