The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through
the theorem of Wagner (1937) that graphs having no 
minor can be constructed
using clique-sum operations to combine planar graphs
and this graph.
The Wagner graph has the most spanning trees among the six 8-vertex cubic graphs, namely 392.
