The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array {5,4,1,1;1,1,4,5}. It is also distance-transitive. It is a double cover of the complement of the Clebsch graph (Brouwer et al. 1989, p. 266). It is implemented in the Wolfram Language as GraphData["WellsGraph"]. It has graph diameter 4, girth 5, graph radius 4, and is Hamiltonian and nonplanar. It has...