Topological Properties of Bi-Rotator Graphs(Theory/Models of Computation)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents a new interconnection network called bi-rotator graph. It is originated from the rotator graph. The rotator graph has many unidirectional edges and the bi-rotator graph is constructed by making edges of the rotator graph bidirectional The bidirectional edges can help to reduce the average routing distance and increase the flexibility of applications. Therefore, we propose the bi-rotator graph as an alternative to the rotator graph. In this paper, we will first illustrate how to construct the bi-rotator graph and present the node-to-node routing algorithm. Next, we will propose the algorithm for building Hamiltonian cycle, which demonstrates that the bi-rotator graph is Hamiltonian. Finally, we provide a dilation-one algorithm for embedding arbitrary size of cycle into the bi-rotator graph and show that the bi-rotator graph is Hamiltonian-connected

• 社団法人電子情報通信学会の論文
• 2003-10-01

著者

• Hsu Chiun-chien

  Department Of Information Management National Taiwan University Of Science And Technology

• Lin Hon-ren

  Department Of Information Management National Taiwan University Of Science And Technology:department

関連論文

• Topological Properties of Bi-Rotator Graphs(Theory/Models of Computation)

スポンサーリンク