The MoebiusKantorGraph() command returns the Möbius-Kantor graph, a symmetric bipartite cubic graph with 16 vertices and 24 edges.

It is named after August Ferdinand Möbius and Seligmann Kantor.

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

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

$G≔\mathrm{MoebiusKantorGraph}\left(\right)$

$G≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 16\; vertices\; and\; 24\; edges}$

$\mathrm{IsBipartite}\left(G\right)$

$\mathrm{true}$

$\mathrm{DrawGraph}\left(G\right)$

"Möbius-Kantor graph", Wikipedia. http://en.wikipedia.org/wiki/Mobius-Kantor_graph