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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Reconfiguring Hamiltonian paths in complete joins

Sam Vaseghi
2 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

Reconfiguring Hamiltonian paths in complete joins

Sam Vaseghi
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon