Möbius ladder

From Wikipedia, the free encyclopedia

In the mathematical area of 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₆ = 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).

Contents 1 Properties 2 Graph minors 3 Chemistry and Physics 4 Combinatorial optimization 5 References 6 External links

[edit] Properties

Every Möbius ladder is nonplanar. Möbius ladders have crossing number one, and can be embedded without crossings on a torus or projective plane. Li (2005) explores embeddings of these graphs onto higher genus surfaces.

Möbius ladders are vertex-transitive but (again with the exception of M₆) not edge-transitive: each edge from the cycle from which the ladder is formed belongs to a single 4-cycle, while each rung belongs to two such cycles.

When n ≡ 2 (mod 4), M_n is bipartite. When n ≡ 0 (mod 4), by Brooks' theorem M_n has chromatic number 3. De Mier and Noy (2005) show that the Möbius ladders are uniquely determined by their chromatic polynomials.

The Möbius ladder M₈ has 392 spanning trees; it and M₆ have the most spanning trees among all cubic graphs with the same number of vertices (Jakobson and Rivin 1999; Valdes 1991). However, the 10-vertex graph with the most spanning trees is the Petersen graph, which is not a Möbius ladder.

[edit] Graph minors

Möbius ladders play an important role in the theory of graph minors. The earliest result of this type is a theorem of Wagner (1937) that graphs with no K₅ minor can be formed by simple operations that combine planar graphs and the Möbius ladder M₈; for this reason M₈ is sometimes called the Wagner graph.

Gubser (1996) defines an almost-planar graph to be a nonplanar graph for which every nontrivial minor is planar; he shows that 3-connected almost-planar graphs are Möbius ladders or members of a small number of other families, and that other almost-planar graphs can be formed from these by a sequence of simple operations.

Maharry (2001) 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.

[edit] Chemistry and Physics

Walba et al (1982) first synthesized molecular structures in the form of a Möbius ladder, and since then this structure has been of interest in chemistry and chemical stereography (Simon 1993), especially in view of the ladder-like form of DNA molecules. With this application in mind, Flapan (1989) studies the mathematical symmetries of embeddings of Möbius ladders in R³.

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 (Mila et al 1998; Deng et al 2002).

[edit] Combinatorial optimization

Möbius ladders have also been used in computer science, as part of integer programming approaches to problems of set packing and linear ordering. Certain configurations within these problems can be used to define facets of the polytope describing a linear programming relaxation of the problem; these facets are called Möbius ladder constraints (Bolotashvili et al 1999; Borndörfer and Weismantel 2000; Grötschel et al 1985a, 1985b; Newman and Vempala 2004).

[edit] References

[edit] External links

• Eric W. Weisstein, Möbius Ladder at MathWorld.