A complete undirected graph of order n has (n-1)!/2 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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics