The Hamiltonian property of consecutive-\(d\) digraphs (Q1310230): Difference between revisions

Let be \(G\) a consecutive-\(d\) digraph whose \(n\) nodes are labelled by the residues modulo \(n\) such that a link exists from \(i\) to \(j\) iff \(j \equiv q_ i+v\), \(q_ i+v+1,\dots, q_ i+ v+d-1\) (modulo \(n)\). The authors prove that \(G\) is Hamiltonian iff \(d \geq \text{gcd} (n,q) >1\) and that \(G\) is Hamiltonian if \(\text{gcd} (n,q)=1\) for all \(d \geq 5\). This extends the characterisation of Hamiltonian consecutive--1 digraphs of \textit{F. K. Hwang} [Oper. Res. Lett. 6, No. 3, 125-127 (1987; Zbl 0615.05033)].