It is the first work which takes structure faults into account to study fault-tolerant pancyclicity of interconnection networks. Published in: 2019 IEEE Intl ...

It has been widely used because of its regular topology, low degree of nodes and easy implementation on a single chip. We study the cycle embedding into Q3 ...

It is proved that there is an arbitrary length cycle from 3 to |V (Q3/r - W)| if the faulty component is no more than r-1 and every fault component is ...

The topology of interconnection network defines the connections between the processors of the parallel computer system. Researchers have proposed numerous ...

Chen considered the problem of fault-free cycles passing through prescribed a linear forest in an n-dimensional hypercube Qn with some faulty edges and obtained ...

Since the k-ary n-cube is regular of degree 2 n , the fault-tolerant degrees 2 n - 2 and 2 n - 3 are optimal. The reason is as follows. First, there exists no ...

Dec 9, 2024 · In this paper, we study the fault-tolerant routing of 3-ary n-cube without desired intersection. Firstly, we propose a fully adaptive routing ...

Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K 1 , 3-structure faults. Abstract. The k-ary n-cube is one of the most attractive ...

In this paper, we investigate hamiltonian cycle and path embeddings in 3-ary n -cubes Q n 3 based on K 1 , 3 -structure faults, which means each faulty element ...

Feb 11, 2021 · Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K1,3-structure faults. Journal of Parallel and Distributed Computing, 2018 ...