The diameters of some transition graphs constructed from Hamilton cycles

Mariko Hagita, Yoshiaki Oda, Katsuhiro Ota

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)105-117
Number of pages13
JournalGraphs and Combinatorics
Volume18
Issue number1
DOIs
Publication statusPublished - 2002

Fingerprint

Hamilton Cycle
Graph in graph theory
Undirected Graph
Complete Graph
Adjacent
If and only if

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

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

In: Graphs and Combinatorics, Vol. 18, No. 1, 2002, p. 105-117.

Research output: Contribution to journalArticle

@article{d3b85a922d30442a90ff4c133d4ea19b,
title = "The diameters of some transition graphs constructed from Hamilton cycles",
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.",
author = "Mariko Hagita and Yoshiaki Oda and Katsuhiro Ota",
year = "2002",
doi = "10.1007/s003730200006",
language = "English",
volume = "18",
pages = "105--117",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "1",

}

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 -