科研之友
微信
新浪微博
Facebook
分享链接
摘要
A new family of interconnection networks WG(n) is proposed, that is constant degree 3 Cayley graph, and is isomorphic to a Cayley graph of the wreath product Z(2)/S-n when the generator set is chosen properly. Its different algebraic properties is investigated and a routing algorithm is given with the diameter upper bounded by 3n(2) - 6n 4. The embedding properties and the fault tolerance are devired. In conclusion, we present a comparison of some familiar networks with constant degree 3.
