Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T10:43:25.076Z Has data issue: false hasContentIssue false

A Note on a Theorem of H. L. Abbott

Published online by Cambridge University Press:  20 November 2018

Robert J. Douglas*
Affiliation:
University of Washington, Seattle, Washington
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.

Let In be the graph of the unit n-dimensional cube. Its 2n vertices are all the n-tuples of zeros and ones, two vertices being adjacent (joined by an edge) if and only if they differ in exactly one coordinate. A path P in In is a sequence x 1, …, x m of distinct vertices in In where x i is adjacent to x i+1 for 1 ≤ i ≤ m-1; P is a circuit if it is also true that x m and x 1 are adjacent. A path is Hamiltonian if it passes through all the vertices of In . Finally, for vertices x and y in In , we define d(x, y) to be the graph theorectic distance between x and y, i.e., the number of coordinates in which x and y differ.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1970