循环群上4度Bi-Cayley网络的最优路由算法  

The Optimal Routing Algorithm of Bi-Cayley Graphs with Four Degrees on Cyclic Groups

作　　者：钟玮[1] 谢小花 

机构地区：[1]闽南师范大学计算机学院,福建漳州363000 [2]厦门市第二中学,福建厦门361000

出　　处：《闽南师范大学学报（自然科学版）》2016年第1期62-69,共8页Journal of Minnan Normal University：Natural Science

基　　金：国家自然科学基金资助项目(60973150);闽南师范大学杰青项目(MJ13002)

摘　　要：循环群上4度Bi-Cayley图是二部图,是无向双环网络的一种自然扩展.该网络具有很多良好的拓扑性质,使得其在并行处理网络中具有良好的应用前景.研究了循环群上4度Bi-Cayley网络BC(n;±s_1,±s_2)的最小非负解、最小交叉解和其对应的无向双环网的L形瓦四个参数的关系,并得到了该网络的最优路由算法.Bi-Cayley graphs with four degrees on cyclic groups are bipartite graphs, which are natural extension of undirected double loop networks. Have a lot of good topological properties and have good application prospect in parallel processing network. Study the relationship between the minimum nonnegative solution, the minimum cross solution and the l-shaped tile’s four parameters of its corresponding undirected double loop network, and get an optimal routing algorithm for the Bi-cayley BC（n;＆#177;s1, ＆#177;s2） network.

关 键 词：图 最优路由算法 最小非负解 最小交叉解 

分 类 号：O157.9[理学—数学] TP302[理学—基础数学]