Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T18:19:39.692Z Has data issue: false hasContentIssue false

On the Möbius Ladders

Published online by Cambridge University Press:  20 November 2018

Richard K. Guy
Affiliation:
University of Calgary
Frank Harary
Affiliation:
University of Michigan and University College, London
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.

Consider the graph Mn, where n = 2r ≥ 6, consisting of a polygonof length n and all n/2 chords joining opposite pairs of vertices. Thisgraph has 2r vertices which we denote by 1, 2, 3,..., 2r, and the 3r(undirected) edges

We call Mn the n-ladder, defined thus far only for n even. Thethree smallest n-ladders with n even are shown in Figure 1.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1967