In graph theory, the Möbius ladderMn is a cubiccirculant graph with an even numbern of vertices, formed from an n-cycle by adding edges connecting opposite pairs of vertices in the cycle. It is so-named because Mn has exactly n/2 4-cycles which link together by their shared edges to form a topological Möbius strip. Möbius ladders were named and first studied by.
Properties
Every Möbius ladder is a nonplanarapex graph, meaning that it cannot be drawn without crossings in the plane but removing one vertex allows the remaining graph to be drawn without crossings. Möbius ladders have crossing number one, and can be embedded without crossings on a torus or projective plane. Thus, they are examples of toroidal graphs. explores embeddings of these graphs onto higher genus surfaces. Möbius ladders are vertex-transitive – they have symmetries taking any vertex to any other vertex – but they are not edge-transitive. The edges from the cycle from which the ladder is formed can be distinguished from the rungs of the ladder, because each cycle edge belongs to a single 4-cycle, while each rung belongs to two such cycles. Therefore, there is no symmetry taking a cycle edge to a rung edge or vice versa. When n ≡ 2, Mn is bipartite. When n ≡ 0, it is not bipartite. The endpoints of each rung are an even distance apart in the initial cycle, so adding each rung creates an odd cycle. In this case, because the graph is 3-regular but not bipartite, by Brooks' theorem it has chromatic number 3. show that the Möbius ladders are uniquely determined by their Tutte polynomials. The Möbius ladder M8 has 392 spanning trees; it and M6 have the most spanning trees among all cubic graphs with the same number of vertices. However, the 10-vertex cubic graph with the most spanning trees is the Petersen graph, which is not a Möbius ladder. The Tutte polynomials of the Möbius ladders may be computed by a simple recurrence relation.
Möbius ladders play an important role in the theory ofgraph minors. The earliest result of this type is a theorem of that graphs with no K5 minor can be formed by using clique-sum operations to combine planar graphs and the Möbius ladder M8; for this reason M8 is called the Wagner graph. 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. 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.
Chemistry and physics
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, especially in view of the ladder-like form of DNA molecules. With this application in mind, studies the mathematical symmetries of embeddings of Möbius ladders in R3. 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.
