Hamiltonian decomposition of recursive circulant graphs Original Research Article

The graph G(N,d) has vertex set V={0,1,…,N−1}, with {v,w} an edge if v−w≡±di(mod N) for some 0⩽i⩽⌈logd N⌉−1. We show that the circulant graph G(cdm,d) is Hamilton decomposable for all positive integers c,d, and m with c