(1) Department of Mathematics, Xiamen University, 361005 Xiamen, P.R. China;(2) College of Computer Science, South China University of Technology, 510641 Guangzhou, P.R. China
Abstract:
A new family of interconnection networks WGn is proposed, that is constant degree 3 Cayley graph, and is isomorphic to a Cayley graph of the wreath product Z2 Sn 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 3n2 - 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.