 The Möbius ladder "M"8 has 392 spanning trees; it and "M"6 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.