desargues_graph#
- graph_tool.collection.desargues_graph()[source]#
Returns the Desargues Graph
- Returns:
- g
Graph
Desargues Graph with 20 nodes and 30 edges
- g
Notes
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].
References