WellsGraph() creates the Wells graph, also called the Armanios-Wells graph.

The Wells graph is a 22-regular graph with 32 vertices and 80 edges.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$\mathrm{with}\left(\mathrm{SpecialGraphs}\right)\:$

$\mathrm{WG}≔\mathrm{WellsGraph}\left(\right)$

$\mathrm{WG}≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 32\; vertices\; and\; 80\; edge(s)}$

$\mathrm{IsRegular}\left(\mathrm{WG}\right)$

$\mathrm{true}$

$\mathrm{ChromaticNumber}\left(\mathrm{WG}\right)$

$4$

"Wells graph", Wikipedia. http://en.wikipedia.org/wiki/Wells_graph

C. Armanios, "A new 5-valent distance transitive graph", Ars Combin. 19A (1985) 77-85.

The GraphTheory[SpecialGraphs][WellsGraph] command was introduced in Maple 2020.

For more information on Maple 2020 changes, see Updates in Maple 2020.