Embedding Hamiltonian Paths in $k$-Ary $n$-Cubes With Exponentially-Many Faulty Edges

Abstract

The <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$k$</tex-math></inline-formula> -ary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> -cube <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$Q_{n}^{k}$</tex-math></inline-formula> is one of the most popular interconnection networks engaged as the underlying topology of data center networks, on-chip networks, and parallel and distributed systems. Due to the increasing probability of faulty edges in large-scale networks and extensive applications of the Hamiltonian path, it becomes more and more critical to investigate the fault tolerability of interconnection networks when embedding the Hamiltonian path. However, since the existing edge fault models in the current literature only focus on the entire status of faulty edges while ignoring the important information in the edge dimensions, their fault tolerability is narrowed to a minimal scope. This paper first proposes the concept of the partitioned fault model to achieve an exponential scale of fault tolerance. Based on this model, we put forward two novel indicators for the bipartite networks (including <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$Q^{k}_{n}$</tex-math></inline-formula> with even <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$k$</tex-math></inline-formula> ), named partition-edge fault-tolerant Hamiltonian laceability and partition-edge fault-tolerant hyper-Hamiltonian laceability. Then, we exploit these metrics to explore the existence of Hamiltonian paths and unpaired 2-disjoint path cover in <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$k$</tex-math></inline-formula> -ary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> -cubes with large-scale faulty edges. Moreover, we prove that all these results are optimal in the sense that the number of edge faults tolerated has attended to the best upper bound. Our approach is the first time that can still embed a Hamiltonian path and an unpaired 2-disjoint path cover into the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$k$</tex-math></inline-formula> -ary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> -cube even if the faulty edges grow exponentially.