---
tag: PEZ30SD03A
kind: concept
name: Möbius ladder
aliases: [moebius-ladder]
sources:
  - wikipedia: en:7355278@r1369245871
    locator: Möbius ladder
    note: adopted
    mention: wikipedia://en/7355278
    sections: [Summary]
same_as:
  wikidata: Q4307303
  wikipedia: Möbius ladder
inventory: [FG9CGS541A]
---

## Summary

In graph theory, the **Möbius ladder** $M_{n}$, for even numbers $n$, is formed from an $n$-[[cycle|0QQ0F12962]] by adding edges (called "rungs") connecting opposite pairs of vertices in the cycle. It is a cubic, circulant graph, so-named because (with the exception of $M_{6}$ (the utility graph $K_{3,3}$), $M_{n}$ has exactly $n/2$ four-cycles which link together by their shared edges to form a topological [[Möbius strip|04AJE0M271]]. Möbius ladders were named and first studied by (txt).