[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

The Diameters of Some Transition Graphs Constructed from Hamilton Cycles

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: November 4, 1999 Final version received: August 28, 2000

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730200006

Keywords

Navigation