Counting Structures in the Möbius Ladder

Authors

John P. McSorley, Southern Illinois University CarbondaleFollow

Comments

Published in Discrete Mathematics, 184(1-3), 137-164. (Document that includes figures is available there.)

Abstract

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

Recommended Citation

McSorley, John P. "Counting Structures in the Möbius Ladder." (Apr 1998).