blob: c93a1c99acfd79c21fe5d8d0139c57d6c48c5e92 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
\newpage\section{Heawood graph}\label{heawood}
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––– HEAWOOD ––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\begin{NewMacroBox}{grHeawood}{\oarg{options}}
\medskip
From Wikipedia \url{http://en.wikipedia.org/wiki/Heawood_graph}
\emph{The Heawood graph is an undirected graph with 14 vertices and 21 edges. Each vertex is adjacent to exactly three edges (that is, it is a cubic graph), and all cycles in the graph have six or more edges. Percy John Heawood (1861-1955) was an English mathematician who spent a large amount of time on questions related to the four colour theorem.}
\medskip
From MathWorld \url{http://mathworld.wolfram.com/HeawoodGraph.html}
\emph{The Heawood graph is the unique $(3,6)$-cage graph and Moore graph and is graph illustrated below in one of his embeddings.}
\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}}
\end{NewMacroBox}
\subsection{\tkzname{Heawood graph}}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}%
\GraphInit[vstyle=Shade]
\grHeawood[RA=7]
\end{tikzpicture}
\end{tkzexample}
\end{center}
\vfill\newpage
It can be represented in LCF notation as $\big[5,-5\big]^7$
\tkzcname{grLCF[RA=5]\{5,9\}\{7\}} gives the result because $-5 = 9\ mod\ 14$.
\subsection{\tkzname{Heawood graph with LCF notation}}\label{lcf2}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}%
\GraphInit[vstyle=Art]
\grLCF[RA=7]{5,9}{7}%
\end{tikzpicture}
\end{tkzexample}
\end{center}
\vfill\endinput
|