In graph theory, the Möbius ladder Mn, for even numbers n, is formed from an n-cycle by adding edges (called "rungs") connecting opposite pairs of vertices in the cycle.

De Mier & Noy (2004) show that the Möbius ladders are uniquely determined by their Tutte polynomials.

Maharry (2000) shows that almost all graphs that do not have a cube minor can be derived by a sequence of simple operations from Möbius ladders.

In particular, as she shows, every three-dimensional embedding of a Möbius ladder with an odd number of rungs is topologically chiral: it cannot be converted into its mirror image by a continuous deformation of space without passing one edge through another.

Möbius ladders have also been used as the shape of a superconducting ring in experiments to study the effects of conductor topology on electron interactions.

[5] Möbius ladders have also been used in computer science, as part of integer programming approaches to problems of set packing and linear ordering.