N amed G raph s v 1.00 c AlterMundus

11 Desargues 34
SECTION 11
Desargues
\grDesargues[〈options〉]
From Wikipedia : http://en.wikipedia.org/wiki/Desargues_graph
In the mathematical field of graph theory, the Desargues graph is a 3-regular graph with 20 vertices and 30
edges, formed as the Levi graph of the Desargues configuration.The Desargues graph can also be formed as a
double cover of the Petersen graph, as the generalized Petersen graph G(10,3), or as the bipartite Kneser graph
H 5,2 .
From MathWord : http://mathworld.wolfram.com/DesarguesGraph.html
The Desargues graph is a cubic symmetric graph distance-regular graph on 20 vertices and 30 edges, illustrated
above in several embeddings. It can be represented in LCF notation as (Frucht 1976) and is isomorphic to the bipartite
Kneser graph . It is the incidence graph of the Desargues configuration. MathWorld by E.Weisstein
The Desargues graph is implemented in tkz-berge as \grDesargues with two forms.
11.1 The Desargues graph : form 1
a 6
a 5
a 4
a 7
a 3
a 8
a 2
a 9
a 1
a 10
a 0
a 11
a 12
a 13
a 14
a 15
a 16
a 17
a 18
a 19
\begin{tikzpicture}[scale=.6]
\grDesargues[Math,RA=6]
\end{tikzpicture}
NamedGraphs
AlterMundus