Hostname: page-component-7bb8b95d7b-wpx69 Total loading time: 0 Render date: 2024-09-17T04:01:51.039Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Möbius Ladders

Published online by Cambridge University Press:  20 November 2018

Richard K. Guy  and
Frank Harary
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 polygon of length n and all n/2 chords joining opposite pairs of vertices. This graph 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. The three smallest n-ladders with n even are shown in Figure 1.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 10 , Issue 4 , October 1967 , pp. 493 - 496
Copyright
Copyright © Canadian Mathematical Society 1967

References

1. Guy, R. K., A combinatorial problem. Bull. Malayan Math. Soc. 7 (1966), 68-72.Google Scholar
2. Harary, F., On minimally nonplanar graphs. Ann. Univ. Sci. Budapest. Eótvós Sec. Math. 8 (1966), 13-15.Google Scholar
3. Harary, F. and Hill, A., On the number of crossings in a complete graph. Proc. Edinburgh Math. Soc. 13 (1966), 333-338.Google Scholar
4. Kuratowski, K., Sur le problème des courbesgauches en topologie. Fund. Math. 15 (1933), 271-283.Google Scholar
5. Zeeman, E. C., Unknotting 2-spheres in 5 dimensions. Bull. Amer. Math. Soc. 66 (1960), 198.Google Scholar