| A NEW FAMILY OF TRIVALENT CAYLEY NETWORKS ON WREATH PRODUCT Zm ～ Sn |
| |
| 作者姓名： | Shuming ZHOU |
| |
| 作者单位： | [1]Key Laboratory of Network Seeurity and Cryptology （ Fujian Normal University）, Fujian Province University, Fuzhou, 350007 [2]College of Mathematics and Computer Science, Fujian Normal University, Fuzhou, 350007, China. |
| |
| 基金项目： | 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网络 互联网络 微分代数学 系统科学 |
| 收稿时间： | 2003-10-29 |
| 修稿时间： | 2003-10-292005-04-06 |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
|
