### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 105-117 |

Number of pages | 13 |

Journal | Graphs and Combinatorics |

Volume | 18 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2002 Dec 1 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'The diameters of some transition graphs constructed from Hamilton cycles'. Together they form a unique fingerprint.

## Cite this

Hagita, M., Oda, Y., & Ota, K. (2002). The diameters of some transition graphs constructed from Hamilton cycles.

*Graphs and Combinatorics*,*18*(1), 105-117. https://doi.org/10.1007/s003730200006