Counting structures in the Möbius ladder

Authors

John P. McSorley, Michigan Technological University

Document Type

Article

Publication Date

4-6-1998

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. © 1998 Elsevier Science B.V. All rights reserved.

Publication Title

Discrete Mathematics

Recommended Citation

McSorley, J. (1998). Counting structures in the Möbius ladder. Discrete Mathematics, 184(1-3), 137-164. http://doi.org/10.1016/S0012-365X(97)00086-1
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/7264