The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013).
The Lemke graph is the smallest graph that does not have a property related to the pebbling number known as the 2-pebbling property (Hurlbert 2013).