Embedding paths into the 4-ary n-cube with faulty nodes

Abstract

A k-ary n-cubes Q<sup>k</sup><inf>n</inf> is an important network for information transportation. In this paper, we research 4-ary n-cubes, and prove that a 4-ary n-cube with &#x0192; &#x2264; n&#x2212;1 faulty vertices admits a fault-free path of every even length from 2n to 4<sup>n</sup> &#x2212;2&#x0192; &#x2212;2 between any two healthy vertices &#x03C5… (More)

Topics

2 Figures and Tables

Slides referencing similar topics