The graph G(N, d) has vertex set V = {0, 1, …, N - 1}, with {v, w} an edge if v - w ≡ ± d~i(modN) for some 0 ≤ i ≤ [log_dN] - 1. We show that the circulant graph G(cd~m, d) is Hamilton decomposable for all positive integers c, d, and m with c < d. This extends work of Micheneau and answers a special case of a question of Alspach.
展开▼
