超立方体拓扑结构中通信传输路由长度的研究
Communication Route Length Research in Hypercube
-
摘要: 对于一般的n,本文给出了n维超立方体拓扑结构On(Qn中的每个顶点代表一台计算机)中通信传输路由长度互不相等的最大顶点子集中的顶点个数,并且,对某些n求出了Qn 中通信传输路由长度互不相等的最大顶点子集。Abstract: For general n,this paper gives the number of the vertices in a maximal subset of vertices in which the lengths of the communication transmission routes in n-dimensional hypercubic topological structure Qn are different,every vertex of which represents a computer.Such subsets for some n are also given.
下载: