summaryrefslogtreecommitdiff
path: root/macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Cocktail_Party.tex
diff options
context:
space:
mode:
authorNorbert Preining <norbert@preining.info>2021-01-22 03:00:46 +0000
committerNorbert Preining <norbert@preining.info>2021-01-22 03:00:46 +0000
commite1a7798f45cd37c0aa0bfaaef5f0acb4e48bc867 (patch)
treed2bbebcdb7bcb8fe013a9d3cbd2cff880b18afbf /macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Cocktail_Party.tex
parent37cb9bbabbfe1a8d0d1334832814ccbefcf9ac0a (diff)
CTAN sync 202101220300
Diffstat (limited to 'macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Cocktail_Party.tex')
-rw-r--r--macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Cocktail_Party.tex50
1 files changed, 50 insertions, 0 deletions
diff --git a/macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Cocktail_Party.tex b/macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Cocktail_Party.tex
new file mode 100644
index 0000000000..3ed5e45ced
--- /dev/null
+++ b/macros/latex/contrib/tkz/tkz-berge/NamedGraphs/doc/latex/NamedGraphs-Cocktail_Party.tex
@@ -0,0 +1,50 @@
+\newpage\section{Cocktail Party graph}\label{cocktail}
+%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
+%<––––––––––––––––––––––––––––– Cocktail Party –––––––––––––––––––––––––––>
+%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
+\begin{NewMacroBox}{grCocktailParty}{\oarg{options}\var{integer}}
+
+\medskip
+From MathWord : \url{http://mathworld.wolfram.com/CocktailPartyGraph.html}
+
+\emph{The cocktail party graph of order , also called the hyperoctahedral graph (Biggs 1993, p. 17) is the graph consisting of two rows of paired nodes in which all nodes but the paired ones are connected with a graph edge. It is the graph complement of the ladder graph , and the dual graph of the hypercube graph.\hfill\break
+This graph arises in the handshake problem. It is a complete n-partite graph that is denoted by Brouwer et al. (1989, pp. 222-223), and is distance-transitive, and hence also distance-regular.\hfill\break
+The cocktail party graph of order is isomorphic to the circulant graph.}
+\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 Chvátal graph is implemented in \tkzname{tkz-berge} as \tkzcname{grCocktailParty} with two forms.
+\end{NewMacroBox}
+
+\subsection{\tkzname{Cocktail Party graph form 1 }}
+\tikzstyle{VertexStyle} = [shape = circle,
+ shading = ball,%
+ ball color = green,%
+ minimum size = 24pt,%
+ draw]
+\SetVertexMath
+\tikzstyle{EdgeStyle} = [thick,%
+ double = orange,%
+ double distance = 1pt]
+\begin{center}
+ \begin{tkzexample}[vbox]
+ \begin{tikzpicture}
+ \grCocktailParty[RA=3,RS=5]{4}
+ \end{tikzpicture}
+\end{tkzexample}
+\end{center}
+
+\vfill\newpage
+\subsection{\tkzname{Cocktail Party graph form 2 }}
+
+\vspace*{2cm}
+\begin{center}
+ \begin{tkzexample}[vbox]
+ \begin{tikzpicture}
+ \grCocktailParty[form=2,RA=4,RS=6]{4}
+ \end{tikzpicture}
+\end{tkzexample}
+\end{center}
+\endinput