Reconfiguring Hamiltonian paths in complete joins
When can one Hamiltonian path be transformed into another by rotations at its ends? We answer this question for the complete join of two nonempty graphs. If one part has \(d\ge1\) more vertices than the other, the connected components of the rotation graph correspond bijectively to the components of a graph of \((d-1)\)-edge linear forests in the larger part, with one edge exchanged at each step. Whenever a Hamiltonian path exists and the part sizes differ by at most five, the rotation graph is connected and its diameter has linear order in the number of vertices. Together with Kazazi’s examples, this makes six the first imbalance at which connectivity can fail. For joins on \(n\) vertices of minimum degree at least \(n/2\), we also obtain connectivity when \(d\ge2\) and \(n\ge9d-14\). A planar example gives the exact temporary increase in the maximum leg length needed to transform one tour into another by depot-incident edits.
Authors
- Sam Vaseghi (ORCID: https://orcid.org/0009-0006-4105-1949)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24405402
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint