### 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 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)
- Discrete Mathematics and Combinatorics

### Cite this

*Graphs and Combinatorics*,

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

**The diameters of some transition graphs constructed from Hamilton cycles.** / Hagita, Mariko; Oda, Yoshiaki; Ota, Katsuhiro.

Research output: Contribution to journal › Article

*Graphs and Combinatorics*, vol. 18, no. 1, pp. 105-117. https://doi.org/10.1007/s003730200006

}

TY - JOUR

T1 - The diameters of some transition graphs constructed from Hamilton cycles

AU - Hagita, Mariko

AU - Oda, Yoshiaki

AU - Ota, Katsuhiro

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036973088&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036973088&partnerID=8YFLogxK

U2 - 10.1007/s003730200006

DO - 10.1007/s003730200006

M3 - Article

VL - 18

SP - 105

EP - 117

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -