Returns the Desargues Graph
The Desargues Graph is a non-planar, distance-transitive cubic graph with 20 nodes and 30 edges 1. It is a symmetric graph. It can be represented in LCF notation as [5,-5,9,-9]^5 2.
create_using (NetworkX graph constructor, optional (default=nx.Graph)) – Graph type to create. If graph instance, then cleared before populated.
G – Desargues Graph with 20 nodes and 30 edges
- Return type