广东工业大学学报 ›› 2011, Vol. 28 ›› Issue (2): 81-84.

• 综合研究 • 上一篇    下一篇

类Cayley 图:环的递归立方体网络

  

  1. 广东工业大学 应用数学学院,广东 广州 510006
  • 出版日期:2011-06-25 发布日期:2011-06-25

A Class of Cayley Graphs: Recursive Cubes of Ring Networks

  1. Faculty of Applied Mathematics, Guangdong University of Technology, Guangzhou 510006, China
  • Online:2011-06-25 Published:2011-06-25

摘要: 证明环的递归立方体网络(Recursive Cube of Rings network)(简称RCR网络)也是Cayley图,它有很多良好的拓扑性质.采用有限群导出Cayley图的方法,先定义了一个新的群,然后重新证明了RCR网络是一类Cayley 图,并更改了RCR中节点的表示方法.

关键词: 环的递归立方体网络(Recursive cube of rings network);Cayley图;互连网络;群

Abstract: Recursive Cube of Rings(RCR) is proven to be the Cayley graph, known as a quite suitable interconnected network which possesses many good topological properties. The Cayley graph is obtained from the finite group. Firstly, a new group was defined. Then, RCR was proved to be the Cayley graph. Finally, necessary modifications to the way of marking the nodes in RCR were made accordingly.

Key words: recursive cube of ring network; Cayley Graph; network; group

[1] 徐俊明.组合网络理论[M].北京:科学出版社,2007.

[2] Sun Y,Cheung P,Lin X.Recursive cube of Rings:A new topology for interconnection networks[J].IEEE.Parallel Dist.Syst,2000,11(3):275-286.

[3] 徐俊明,徐克力.Cayley图的笛卡尔乘积[J].中国科学技术大学学报,2001,31(6):635-640.

[4] Hu H,Gu N,Cao J.A note on recursive cube of rings network[J].IEEE Trans Parallel and Dist Syst,2005,16(10):1007-1008.

[5] Choi D,Lee O,Chung I.A parallel routing a-lg-orithm on recursive cube of rings networks employing Hamiltonian circuit Latin square[J].Inf Sci,2008,178:1533-1541.

[6] 唐高华.近世代数[M].北京:清华大学出版社,2008.

[7] 赵淼清.近世代数[M].杭州:浙江大学出版社,2005.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!