An algorithm to embed Hamiltonian path into ECQ network
Dongfang Zhou, Jianxi Fan, Cheng‐Kuan Lin, Yan Wang, Baolei Cheng · 2017
The (s+t+1)-dimensional exchanged crossed cube (ECQ(s, t) for short), combines the advantage of the exchanged hypercube and the crossed cube. The Hamiltonicity connectivity is an important property in interconnection networks. In this paper, firstly, we prove that there exists not only a Hamiltonian path but also less than 1 than Hamiltonian path between any two distinct vertices in ECQ(s, t), where s≥2 t≥3, and s≤t. Then, we propose an efficient algorithm for finding Hamiltonian path in ECQ(s, t).