Journal of Guangdong University of Technology ›› 2010, Vol. 27 ›› Issue (3): 35-40.

• Comprehensive Studies • Previous Articles     Next Articles

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

  

  1. Faculty of Applied Mathematics，Guangdong University of Technology，Guangzhou 510006，China
  • Online:2010-09-25 Published:2010-09-25

HTML

PDF (PC)

2433

Abstract: 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 form ula between two points is proved by using the nature of the cycle perm utation of the Group Th eory，and the general algebraic expression for the number of all the shortest paths between two nodes is provided．

Key words: the star graph；the shortest path；cycle perm utation；the distance

[1]Day Khaled，Tripa~i Anand．A Comparative Study of Topoiogical Properties of Hypercubes and Star Graphs[J]．IEEE Transactions on Parallel and Distributed Systems，1994，5(1)：31-38．

[2]Akers S B，Harel D，Krishnamurthy B．The star graph：An attractive alternative to the n-cube[C]∥Proc Int Conf．New York：Parallel Processing，1987：393-400．

[3]Chen Chi-Chang，Chen Jianer．Vertex-Disjoint Routings in Star Graphs[J]．IEEE Algorithms and Architectures for Parallel Processing，1995，1：460-464．

[4]Yeh Sheng-I，Yang Chang-Biau，Chen Hon-Chan．Fault—Tolerant Routing on the Star Graph with Safety Vectors[J]．IEEE Parallel Architectures，Algorithms and Networks，2002(5)：266-271．

[5]唐高华．近世代数[M]．北京：清华大学出版社，2008．

[6]徐俊明．组合网络[M]．北京：科学出版社，2007
No related articles found!
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright © 2017 Journal of Guangdong University of Technology
Add：729 East Dongfeng RD., Guangzhou PRC. Postcode: 510090
Tel：020-37626653,020-37626139,020-37626396
Email：xbzrb@gdut.edu.cn
Supported:Beijing Magtech