摘要
提出一种称为一一对应连接 (BC)图的互连网络族 ,使其包含超立方体、交叉立方体和M bius立方体作为其真子集 ,同时又使其具有与超立方体、交叉立方体和M bius立方体相同的对数级的直径和顶点度数、最高连通 (容错 )度和相同的可诊断性等性质 ,从而使对超立方体及与其结构相似的大量互连网络的某些性质的研究合而为一 ;
This paper proposes a family of interconnection networks called bijection-connected (BC) graphs that properly contain the crossed cubes and the Mobius cubes and possess the same logarithm-level diameters and node degrees, the highest connectivity (fault tolerance), and diagnosability as the hypercubes. Thus, this merges the study of some properties of the hypercube and a great many interconnection networks similar to it in structure. In addition, this paper proves that the BC interconnection network family contains a kind of Hamilton-connected graphs and gives a guess on the diameters of the graphs in it.
出处
《计算机学报》
EI
CSCD
北大核心
2003年第1期84-90,共7页
Chinese Journal of Computers
基金
山东省青年科学基金 (Q99G12 )