Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-14T16:24:57.901Z Has data issue: false hasContentIssue false
  • English
  • Français

Hamiltonian Circuits and Paths on the n-Cube

Published online by Cambridge University Press:  20 November 2018

H. L. Abbott
H. L. Abbott*
Affiliation:
Memorial University of Newfoundland
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For positive integral n let Cn denote the n-dimensional unit cube with vertices (δ1, δ2,…, δn) where δi = 0 or 1 for i=1, 2,…, n. Call two vertices of Cn adjacent if the distance between them is 1.

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 9 , Issue 5 , December 1966, pp. 557 - 562
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Gilbert, E.N., Gray codes and paths on the n-cube. Bell Syst. Tech. J. 37, (1958), pages 815-826.Google Scholar
2. See also Mills, W. H., Some complete cycles on the n-cube. Proc. Amer. Math. Soc. 14,(1963), pages 640-643.Google Scholar