info prev up next book cdrom email home

Hamiltonian Path

A loop through a Graph that visits each node exactly once but does not end adjacent to the initial point. The number of Hamiltonian paths on an $n$-Hypercube is 0, 0, 48, 48384, ... (Sloane's A006070, Gardner 1986, pp. 23-24).

See also Hamiltonian Circuit, Hamiltonian Graph


Gardner, M. ``The Binary Gray Code.'' In Knotted Doughnuts and Other Mathematical Entertainments. New York: W. H. Freeman, pp. 23-24, 1986.

Sloane, N. J. A. Sequence A006070/M5295 in ``An On-Line Version of the Encyclopedia of Integer Sequences.'' and Sloane, N. J. A. and Plouffe, S. The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995.

© 1996-9 Eric W. Weisstein