关键词: 有向网络, 单向[k]元[n]立方体, 诊断度, 连通度, PMC模型

Abstract: The connectivity and diagnosability of graphs are two parameters that are closely related to the reliability of interconnection networks. The [g]-good-neighbor connectivity and [g]-good-neighbor diagnosability are more accurate indexes than the connectivity and diagnosability. The [k]-ary [n]-cube is one of the most common interconnection networks for multiprocessor systems, and the unidirectional [k]-ary [n]-cube is the [k]-ary [n]-cube with simplex unidirectional links. This paper shows that the [1]-good-neighbor connectivity, the diagnosability and the [1]-good-neighbor diagnosability of the unidirectional [k]-ary [n]-cube under the PMC model are [k(n-1),] [n] and [kn-1,] respectively.

Key words: directed network, unidirectional [k]-ary [n]-cube, diagnosability, connectivity, PMC model