The DesarguesGraph() command returns the Desargues graph, a distance-transitive cubic graph with 20 vertices and 30 edges.

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

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

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

$G≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 20\; vertices\; and\; 30\; edge(s)}$

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

$\mathrm{false}$

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

"Desargues graph", Wikipedia. http://en.wikipedia.org/wiki/Desargues_graph