A NEW FAMILY OF TRIVALENT CAYLEY NETWORKS ON WREATH PRODUCT Z_m■S_n  

作　　者：Shuming ZHOU Key Laboratory of Network Security and Cryptology(Fujian Normal University),Fujian Province University,Fuzhou,350007 College of Mathematics and Computer Science,Fajian Normal University,Fuzhou,350007,China. 

出　　处：《Journal of Systems Science & Complexity》2006年第4期577-585,共9页系统科学与复杂性学报（英文版）

基　　金：This work was partly supported by the Natural Science Foundation of Fujian Education Ministry under Grant No.JB05333

摘　　要：We propose a new family of interconnection networks （WGn^m） with regular degree three. When the generator set is chosen properly, they are isomorphic to Cayley graphs on the wreath product Zm ～ Sn. In the case of m ≥ 3 and n ≥3, we investigate their different algebraic properties and give a routing algorithm with the diameter upper bounded by [m/2]（3n^2- 8n ＋ 4） - 2n ＋ 1. The connectivity and the optimal fault tolerance of the proposed networks are also derived. In conclusion, we present comparisons of some familiar networks with constant degree 3.

关 键 词：Cayley graph CONNECTIVITY DIAMETER interconnection network ROUTING 

分 类 号：O153.3[理学—数学]