Abstract.
A complete undirected graph of order n has Hamilton cycles. We consider the diameter of a transition graph whose vertices correspond to those Hamilton cycles and any of two vertices are adjacent if and only if the corresponding Hamilton cycles can be transformed each other by exchanging two edges. Moreover, we consider several transition graphs related to it.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: November 4, 1999 Final version received: August 28, 2000
Rights and permissions
About this article
Cite this article
Hagita, M., Oda, Y. & Ota, K. The Diameters of Some Transition Graphs Constructed from Hamilton Cycles. Graphs Comb 18, 105–117 (2002). https://doi.org/10.1007/s003730200006
Issue Date:
DOI: https://doi.org/10.1007/s003730200006