%0 Journal Article
%A ZHANG Wenli
%A LIN Shangwei
%A LI Yihai
%A GUO Huiling
%T Diagnosability of Unidirectional k-Ary n-Cubes Under PMC Model
%D 2019
%R 10.3778/j.issn.1002-8331.1806-0093
%J Computer Engineering and Applications
%P 62-65
%V 55
%N 4
%X 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.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1806-0093