In graph theory, the **Möbius ladder** *M*_{n} is a cubic circulant graph with an even number *n* of vertices, formed from an *n*-cycle by adding edges (called "rungs") connecting opposite pairs of vertices in the cycle. It is so-named because (with the exception of *M*_{6} = *K*_{3,3}) *M*_{n} has exactly *n*/2 4-cycles (McSorley 1998) which link together by their shared edges to form a topological Möbius strip. Möbius ladders were named and first studied by Guy and Harary (1967).

Read more about Möbius Ladder: Properties, Graph Minors, Chemistry and Physics, Combinatorial Optimization

### Famous quotes containing the word ladder:

“You will see ... that it is easier to go down the social *ladder* than to climb it.”

—Albert Camus (1913–1960)