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