Hamiltonian properties of honeycomb meshes

Hamiltonian Properties of DCell Networks

“…) is the concatenation of the following 1-element lists: (10), (01), (11), (20), (21). So L([3] × [2]) = (10,01,11,20,21). Now 000, L(A) is given in Table 2, in the same format as Table 1.…”

“…) is the concatenation of the following 1-element lists: (10), (01), (11), (20), (21). (10,01,11,20,21).…”

“…Wang treated the problem of embedding Hamiltonian cycles into a crossed cube with failed links and found a Hamiltonian cycle in a crossed cubes CQ n tolerating up to n − 2 failed links [18]. Xu et al provided a systematic method to construct a Hamiltonian path in Honeycomb meshes [20].…”

A Novel Conditional Connectivity and Hamiltonian Connectivity of BCube with Various Faulty Elements

“…It has good communication performances because it can build serveral vertex disjoint paths of shorter lengths [16]. The embedding of the path or the cycle is one of the main research topics in networks because many effective algorithms for solving various graph problems have been developed on the basis of paths and cycles [17][18][19][20] and some parallel applications [21,22]. , Hamiltonian path and Hamiltonian cycle embeddings are important properties because the occurrence of congestion and deadlock can be effectively reduced or even avoided by multi-cast algorithms based on Hamiltonian paths and Hamiltonian cycles [23].…”