Hamiltonicity of de Bruijn- and Kautz-based exponential graphs

Determine whether the exponential graphs $K_n^{B(2,k)}$ and $K_n^{K(2,k)}$, formed using the complete graph $K_n$ as base and the de Bruijn network $B(2,k)$ or Kautz network $K(2,k)$ as exponent, are Hamiltonian.

Background

The paper constructs KnB(2,k)K_n^{B(2,k)} and KnK(2,k)K_n^{K(2,k)} as maximally connected and super edge-connected graphs of doubly exponential order with logarithmic diameter. Unlike the DCell network, whose Hamiltonicity is known, the Hamiltonicity of these two exponential graph families is explicitly left unresolved in the comparison of their network properties.

References

On the other hand, their disadvantage is that Hamiltonicity is unknown.

Exponentiation of Graphs  (2501.15716 - Hasunuma, 27 Jan 2025) in Section 6, Subsection 6.1, “De Bruijn and Kautz Networks,” comparison of DCell, $K_n^{B(2,k)}$, and $K_n^{K(2,k)}$