Abstract :
The Möbius ladder, Mn, is a simple cubic graph on 2n vertices. We present a technique which enables us to count exactly many different structures of Mn, and somewhat unifies counting in Mn. We also provide new combinatorial interpretations of some sequences, and ask some questions concerning extremal properties of cubic graphs.
