【摘要】 对于一般的n,本文给出了n维超立方体拓扑结构O_n(Q_n中的每个顶点代表一台计算机)中通信传输路由长度互不相等的最大顶点子集中的顶点个数,并且,对某些n求出了Q_n 中通信传输路由长度互不相等的最大顶点子集。更多还原

【Abstract】 For general n,this paper gives the number of the vertices in a maximal subset ofvertices in which the lengths of the communication transmission routes in n-dimensional hypercubictopological structure Q_n are different,every vertex of which represents a computer.Such subsets forsome n are also given.更多还原