Returns the Desargues Graph
Desargues Graph with 20 nodes and 30 edges
The Desargues Graph is a non-planar, distance-transitive cubic graph with 20 nodes and 30 edges [desargues_wiki]. It is a symmetric graph. It can be represented in LCF notation as \([5,-5,9,-9]^5\) [desargues].