星图上基于循环置换的任意两点之间的最短路径算法  

The Shortest Path Algorithm Between Two Arbitrary Nodes Based on Cycle Permutation in the Star Graph

作　　者：王静[1] 郭大昌[1] 

机构地区：[1]广东工业大学应用数学学院,广东广州510006

出　　处：《广东工业大学学报》2010年第3期35-40,共6页Journal of Guangdong University of Technology

摘　　要：针对路由选择对网络性能起重要作用,提出了星图上任意两点之间的最短路径算法.运用群论的循环置换的性质证明了两点之间的距离公式,给出了两点之间所有最短路径个数的一般代数表达式.For the routing plays an important role in the performance of the network,the shortest path algorithm between two arbitrary nodes in the star graph is proposed.The distance formula between two points is proved by using the nature of the cycle permutation of the Group Theory,and the general algebraic expression for the number of all the shortest paths between two nodes is provided.

关 键 词：星图 最短路径 循环置换 距离 

分 类 号：O152.1[理学—数学]