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

A Class of Cayley Graphs:Recursive Cubes of Ring Networks

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

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.