Dedicated to the Memory of Sir William Rowan Hamilton
History
"In 1857 the famous Irish mathematician Sir William Rowan Hamilton invented a game which used a solid regular dodecahedron (a geometric object having 20 vertices, 30 edges, and 12 faces), 20 pegs (one inserted at each vertex), and a supply of string. (Since the dodecahedron has 12 faces, it makes an ideal desk calendar.) Every vertex was given the name of an important city of the time. The object of the game, called Around the World, was to find a route along the edges of the dodecahedron that visits every city exactly once and terminates where it began. In order for the player to keep track of the cities visited, the player used the string to join pegs in the order in which the route proceeded. This dodecahedron did not prove very popular, so Hamilton also produced a two-dimensional version of the game (see Figure). Apparently, neither version of the game was successful, possibly because a desired route can be found rather easily.

Although graphs with spanning cycles are named for Hamilton, he was not the first to have this idea. Two years before Hamilton introduced his game, T. P. Kirkman posed the following question in a paper which he submitted to the Royal Society of England: Given a graph of a polyhedron, does there exist a cycle passing through every vertex?"

Gary Chartrand, Ortrud R. Oellermann, Applied and algorithmic graph theory. McGraw-Hill (1993).

Time ...
Keywords: graph, hamilton, locality, stability.

Last modified 2001-02-26.

Page master Nikolay K. Khachatryan.

Articles
  • Nikolay K. Khachatryan, On local conditions in hamiltonian cycle problem. CSIT-97, Yerevan 1997, 1-4.
  • A. S. Hasratian, N. K. Khachatrian, Stable properties of graphs. Discrete Math. 90 (1991), 143-152.
  • A. S. Hasratian, N. K. Khachatrian, Some localization theorems on Hamiltonian circuits. J. Combin. Theory 49B (1990), 287-294.
  • N. K. Khachatrian, A local algorithms and edge stability in the problem of Hamiltonian graphs. Institute of Mathematics of Academy of Sciences of Byelorussia, Minsk 1988, 90 p. (Dissertation, Russian).
  • N. K. Khachatrian, On stability of the problem of hamiltonian cycle of a graph. Uchenie zapiski Yerevan Univ., No. 1 (164), 1987. 27-31 (Russian).
  • N. K. Khachatrian, Hamiltonicity and representations of subsets in families of graph vertex subsets. Docladi Acad. Nauk Arm. SSR 82, No. 5 (1986), 198-201 (Russian).
  • A. S. Hasratian, N. K. Khachatrian, An investigation of graph's hamiltonicity by means of neighborhoods of vertices. Docladi Acad. Nauk Arm. SSR 81, No. 3 (1985), 103-106 (Russian).
  • A. S. Hasratian, N. K. Khachatrian, Two theorems on hamiltonian graphs. Mat. Zametki 35 (1984), 55-61. {English translation: Math. Notes 35, No. 1-2 (1984), 32-35.}
Favourite links
Armen Asratian's Home Page
Paintings of Albert Hakobyan
Email me at:
[email protected]
This page has been visited times.