{
  "aliases": [
    "moebius-ladder"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn 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).\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "moebius-ladder"
    ],
    "inventory": [
      "FG9CGS541A"
    ],
    "kind": "concept",
    "name": "Möbius ladder",
    "same_as": {
      "wikidata": "Q4307303",
      "wikipedia": "Möbius ladder"
    },
    "sources": [
      {
        "locator": "Möbius ladder",
        "mention": "wikipedia://en/7355278",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:7355278@r1369245871"
      }
    ],
    "tag": "PEZ30SD03A"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/PEZ30SD03A/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/PEZ30SD03A.md",
  "msc": null,
  "name": "Möbius ladder",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/PEZ/PEZ30SD03A.md",
  "status": null,
  "tag": "PEZ30SD03A",
  "uri": "m2://PEZ30SD03A",
  "url": "https://math2.tamnd.com/wiki/mobius-ladder/",
  "writing": {
    "tag": "PEZ30SD03A",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}