summaryrefslogtreecommitdiff
path: root/macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Desargues.tex
diff options
context:
space:
mode:
authorNorbert Preining <norbert@preining.info>2020-03-10 03:01:27 +0000
committerNorbert Preining <norbert@preining.info>2020-03-10 03:01:27 +0000
commit877268a0de707a979be934d888518f6cc02d73a6 (patch)
tree30597445c86d75b20a836b6c90ab6c31b76d902e /macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Desargues.tex
parent0561778af6f8fde0a3a1c334e2aab9a4f1142d6e (diff)
CTAN sync 202003100301
Diffstat (limited to 'macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Desargues.tex')
-rw-r--r--macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Desargues.tex88
1 files changed, 0 insertions, 88 deletions
diff --git a/macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Desargues.tex b/macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Desargues.tex
deleted file mode 100644
index 496041579b..0000000000
--- a/macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Desargues.tex
+++ /dev/null
@@ -1,88 +0,0 @@
-\newpage\section{Desargues}\label{desargues}
-%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
-%<––––––––––––––––––––––––––––– Desargues –––––––––––––––––––––––––––––––>
-%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
-\begin{NewMacroBox}{grDesargues}{\oarg{options}}
-
-\medskip
-From Wikipedia : \url{http://en.wikipedia.org/wiki/Desargues_graph}
-
-\emph{ 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}$.}
-
-\medskip
-From MathWord : \url{http://mathworld.wolfram.com/DesarguesGraph.html}
-
-\emph{ 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.}
-\href{http://mathworld.wolfram.com/topics/GraphTheory.html}%
- {\textcolor{blue}{MathWorld}} by \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
- {\textcolor{blue}{E.Weisstein}}
-
-\medskip
-The Desargues graph is implemented in \tkzname{tkz-berge} as \tkzcname{grDesargues} with two forms.
-\end{NewMacroBox}
-
-
-\tikzstyle{VertexStyle} = [shape = circle,%
- color = white,
- fill = black,
- very thin,
- inner sep = 0pt,%
- minimum size = 18pt,
- draw]
-\tikzstyle{EdgeStyle} = [thick,%
- double = brown,%
- double distance = 1pt]
-\SetVertexMath
-\subsection{\tkzname{The Desargues graph : form 1}}
-\begin{center}
-\begin{tkzexample}[vbox]
-\begin{tikzpicture}[scale=.6]
- \grDesargues[Math,RA=6]
- \end{tikzpicture}
-\end{tkzexample}
-\end{center}
-
-\vfill\newpage
-\subsection{\tkzname{The Desargues graph : form 2}}
-
-\begin{center}
-\begin{tkzexample}[vbox]
-\begin{tikzpicture}
- \grDesargues[form=2,Math,RA=7]
- \end{tikzpicture}
-\end{tkzexample}
-\end{center}
-
-\vfill\newpage
-\subsection{The Desargues graph wth \tkzname{LCF notation}}
-
-\begin{center}
-\begin{tkzexample}[vbox]
-\begin{tikzpicture}[rotate=90]
- \grLCF[Math,RA=6]{5,-5,9,-9}{5}
- \end{tikzpicture}
-\end{tkzexample}
-\end{center}
-
-
-\vfill\newpage
-\subsection{The Desargues graph with \tkzcname{grGeneralizedPetersen}}
-\begin{center}
-\begin{tkzexample}[vbox]
-\begin{tikzpicture}[rotate=90]
- \tikzstyle{VertexStyle} = [shape = circle,%
- color = white,
- fill = black,
- very thin,
- inner sep = 0pt,%
- minimum size = 18pt,
- draw]
- \tikzstyle{EdgeStyle} = [thick,%
- double = brown,%
- double distance = 1pt]
- \grGeneralizedPetersen[Math,RA=6]{10}{3}
- \end{tikzpicture}
-\end{tkzexample}
-\end{center}
-
-\endinput \ No newline at end of file