The diagnosability of k-ary n-cubes with missing edges

ABSTRACT

The k-ary n-cube is a popular interconnection network for many multiprocessor systems because of its good topological structure. In this paper, we investigated the relationship between the fault diagnosability of k-ary n-cube with missing edges and its minimum degree of vertices. Let G be a k-ary n-cube with missing edges and the minimum degree $\delta \left(G\right)=r.$ Then we show that the diagnosability of G is r for $r\ge 3,n\ge 2$ under the PMC model and BGM model.

GRAPHICAL ABSTRACT

KEYWORDS:

• Interconnection networks
• diagnosability
• fault tolerance
• k-ary n-cubes

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by the National Natural Science Foundation of China [grant numbers 61402317, 61370001, 61302020, 61272263, 61502286].