summaryrefslogtreecommitdiff
path: root/obsolete/macros/latex/contrib/tkz/tkz-berge/doc/latex/TKZdoc-berge-classic.tex
blob: f0ba383631624bc1089e92206cd2d5a1c7853985 (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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
%!TEX root = /Users/ego/Boulot/TKZ/tkz-berge/doc-us/TKZdoc-berge-main.tex
%<–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\section{Classic Graphs}
%<–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<–––––––––––––––––––––––     graphes classiques    –––––––––––––––––––––––––>
%<–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\subsubsection{Cycle graph}
\begin{NewMacroBox}{grCycle}{\oarg{local options}\var{order}}

\medskip
\emph{A cycle graph $C_n$ is a graph on $n$ nodes containing a single cycle through all nodes. Cycle graphs can be generated using \tkzcname{grCycle} in   the \tkzname{tkz-berge.sty} package. Special cases include  the triangle graph and  the square graph.}

\medskip
External links :

\medskip
\begin{itemize}

\item \href{http://mathworld.wolfram.com/CycleGraph.html}%
           {\textcolor{blue}{MathWorld - CycleGraph}} by %
      \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
           {\textcolor{blue}{E.Weisstein}}

\item  \href{http://en.wikipedia.org/wiki/Cycle_graph}%
            {\textcolor{blue}{Wikipedia}}

\end{itemize}
\end{NewMacroBox} 

\subsubsection{Special cases : the triangle graph and  the square graph}


\begin{center}
\begin{tkzexample}[small]
\begin{tikzpicture}
    \GraphInit[vstyle=Shade] 
    \grCycle[prefix=a,RA=3]{5}
    \grCycle[x=4,y=3,prefix=b,RA=2]{3}
    \grCycle[prefix=d,y=6,rotation=30,RA=2]{4}
\end{tikzpicture}
\end{tkzexample} 
\end{center}
 
\newpage
\subsubsection{Complete graph} 
\begin{NewMacroBox}{grComplete}{\oarg{local options}\var{order}}

\medskip
\emph{The more simple definition is "an undirected graph with an edge between every pair of vertices"  or a complete graph  is a simple graph  in which each pair of graph vertices is connected by an edge. The complete graph  with  $n$ graph vertices is denoted $K_n$.  This graph has $\frac{n(n-1)}{2}$ undirected edges.\\
Geometrically, $K_3$ relates to a triangle,$ K_4$ a tetrahedron is the tetrahedral graph  as well as the wheel graph , $K_5$ a pentachoron, etc \dots}

\medskip
External links :

\medskip
\begin{itemize}

\item  \href{http://en.wikipedia.org/wiki/Complete_graph}%
            {\textcolor{blue}{Wikipedia}}

\item \href{http://mathworld.wolfram.com/grComplete.html}%
           {\textcolor{blue}{MathWorld - Complete graph}} by %
      \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
           {\textcolor{blue}{E.Weisstein}}
\end{itemize}
\end{NewMacroBox} 


\subsubsection{Complete Graph order 4}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
  \renewcommand*{\VertexBallColor}{green!50!black}
  \GraphInit[vstyle=Shade]
  \grComplete[RA=5]{7}
\end{tikzpicture}
\end{tkzexample}
\end{center}


\vfill\newpage\null 

\subsubsection{Complete Graph order 4}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
   \renewcommand*{\VertexBallColor}{green!50!black}
   \GraphInit[vstyle=Shade]
   \SetVertexNoLabel
   \grComplete[RA=7]{16}
\end{tikzpicture}
\end{tkzexample}
\end{center}

%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\newpage 
\subsubsection{Circulant graph}
\begin{NewMacroBox}{grCirculant}{\oarg{local options}\var{order}}

\medskip
\emph{The circulant graph  is defined for any order $n$ at least 3, and every subset $L$ of integers which are less than or equal to $n/2$.  A circulant graph is a graph  in which the $i$th graph vertex is adjacent to the ($i+j$)th and ($i-j$)th graph vertices for each $j$ in a list $L$ . The circulant graphs with $L=\{1;\dots;[n/2]\}$  gives the complete graphs  and the circulant graph with $L=\{1\}$  gives the cyclic graphs. The Möbius ladders are examples of circulant graphs.\\
 In graph theory, a graph  whose adjacency matrix is circulant is called a circulant graph.\\
The circulant graph on  vertices on a list of nodes  is implemented as \tkzcname{grCirculant} in the \tkzname{tkz-berge.sty} package.}

\medskip
External links :

\href{http://mathworld.wolfram.com/CirculantGraph.html}%
           {\textcolor{blue}{MathWorld - CirculantGraph}} by %
      \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
           {\textcolor{blue}{E.Weisstein}}
\end{NewMacroBox}

\tikzset{VertexStyle/.style = {shape        = circle,
                               shading      = ball,
                               ball color   = green!40!black,%
                               minimum size = 16pt,%
                               draw}}
\SetUpEdge[style = {thick,%
                    double          = orange,%
                    double distance = 1pt}]

\SetVertexNoLabel
\tikzset{EdgeStyle/.style = {thick,
                             double= orange,
                             double distance = 1pt}} 

\subsubsection{ \opt{Graph  order 5 with L=\{1\}}}

This is a cycle graph.

\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
   \grCirculant[RA=3]{5}{1}%
\end{tikzpicture}
\end{tkzexample}
\end{center}

\subsubsection{\opt{Graph  order 5 with L=\{2\}}}

\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
   \grCirculant[RA=3]{5}{2}%
\end{tikzpicture}
\end{tkzexample}
\end{center}


\subsubsection{\opt{Graph  order 5 with L=\{1,2\}}}

This graph is complete with an order $5$.

\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
   \grCirculant[RA=3]{5}{1,2}%
\end{tikzpicture}
\end{tkzexample}
\end{center}


\subsubsection{\opt{Graph  order 10 with L=\{1,2,3,4,5\}}}

This graph is also complete

\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
    \grCirculant[RA=4]{10}{1,2,3,4,5}%
\end{tikzpicture}
\end{tkzexample}
\end{center}

It's interesting to remark that the numbers 3 and 10 are primer, so if $L=\{3\} $ the graph is containing an Eulerian circuit.
 

\subsubsection{\opt{Graph  order 10 with L=\{3\}}}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
    \grCirculant[RA=4]{10}{3}%
\end{tikzpicture}
\end{tkzexample}
\end{center}

\vfill\newpage\null 
\tikzset{VertexStyle/.style = {shape           = circle,
                               shading         = ball,
                               ball color      = gray!30,%
                               minimum size    = 24pt,%
                               draw}}
\tikzset{EdgeStyle/.style = {thick,%
                               double          = orange,%
                               double distance = 1pt}} 
\SetVertexMath

\subsubsection{\opt{Graph  order 21 with L=\{1,3,10\}}}

\SetVertexNoLabel
\begin{tikzpicture}
  \grCirculant[Math,RA=7]{21}{1,3,10}
\end{tikzpicture}
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<–––––––––––––––––––––––––––   STAR    –––––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>

\newpage 
\subsubsection{Star graph}  

\begin{NewMacroBox}{grStar}{\oarg{local options}\var{order}}

\medskip
\emph{A star graph $S_n$ is a n-graph   with one node having vertex degree $n-1$  and the other $n-1$   having vertex degree $1$. Star graphs can be generated using \tkzcname{grStar} in   the \tkzname{tkz-berge.sty} package.}

\medskip
External links :

\medskip
\begin{itemize}
\item \href{http://mathworld.wolfram.com/StarGraph.html}%
           {\textcolor{blue}{MathWorld - StarGraph}} by %
      \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
           {\textcolor{blue}{Weisstein}}
\end{itemize}
\end{NewMacroBox}

\tikzset{VertexStyle/.style = {shape        = circle,
                                 shading      = ball,
                                 ball color   = orange!40!,%
                                 minimum size = 26pt,%
                                 draw}}
\SetUpEdge[style={thick,%
           double          = orange,%
           double distance = 1pt}]
\SetVertexNoLabel
\tikzset{EdgeStyle/.style = {thick,
                             double= orange,
                             double distance = 1pt }}

\subsubsection{Star graph}
\begin{center}
  \begin{tkzexample}[vbox]
\begin{tikzpicture}[rotate=30,scale=.8]
  \grStar[RA=7]{8}%
\end{tikzpicture}
\end{tkzexample}
\end{center}

%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\newpage 
\subsubsection{Square graph} 

 \begin{NewMacroBox}{grSQCycle}{\oarg{local options}\var{Number}}

\medskip
\emph{A star graph $S_n$ is a n-graph   with one node having vertex degree $n-1$  and the other $n-1$   having vertex degree $1$. Star graphs can be generated using \tkzcname{grStar} in   the \tkzname{tkz-berge.sty} package.}

\medskip
External links :

\medskip
\begin{itemize}
\item \href{http://mathworld.wolfram.com/SquareGraph.html}%
           {\textcolor{blue}{MathWorld - SquareGraph}} by %
      \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
           {\textcolor{blue}{Weisstein}}
\end{itemize}
\end{NewMacroBox}

\subsubsection{Square Cycle graph}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}[scale=.8]
  \grSQCycle[RA=7]{10}%
\end{tikzpicture}
\end{tkzexample}
\end{center}

%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––     WHEEL     –––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\newpage 
\subsubsection{Wheel graph} 

\begin{NewMacroBox}{grWheel}{\oarg{local options}\var{Number}}

\medskip
\emph{A wheel graph   of order $n$  is a graph that contains a cycle of order $n-1$, and for which every  vertex in the cycle is connected to one other  vertex. The wheel  can be defined as the graph , where  is the singleton graph and  is the cycle graph.}

\medskip
External links :

\medskip
\begin{itemize}
\item \href{http://mathworld.wolfram.com/WheelGraph.html}%
           {\textcolor{blue}{MathWorld - WheelGraph}} by %
      \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
           {\textcolor{blue}{Weisstein}}
\end{itemize}
\end{NewMacroBox}

\tikzset{VertexStyle/.style = {shape        = circle,
                               shading      = ball,
                               ball color   = orange!40,%
                               minimum size = 24pt,%
                               draw}}
\SetUpEdge[style={thick,%
                  double          = orange,%
                  double distance = 1pt}]

\SetVertexNoLabel
\tikzset{EdgeStyle/.style = {thick,double= orange,double distance = 1pt}}
 
\vfill
\subsubsection{\tkzname{Wheel graph}}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}[scale=.8]
      \grWheel[RA=7]{13}%
\end{tikzpicture}
\end{tkzexample}
\end{center}

%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––      LADDER        ––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\newpage 
\subsubsection{Ladder graph} 

\begin{NewMacroBox}{grLadder}{\oarg{local options}\var{Number}}

\medskip
\begin{tabular}{llc}
 \toprule   
options   & default  & definition                                           \\
\midrule
\TOline{RA     } { |4|    } {radius  circle n°1   }
\TOline{RS     } { |0|    } {distance between two lines } 
\TOline{prefix } { |a|    } {prefix for vertices        } 
\TOline{prefixx} { |b|    } {prefix for vertices        }       
\TOline{Math   } { |false|} {math mode                  }       
\bottomrule     
\end{tabular}

\medskip
\emph{The ladder graph $L_n$ or cyclic ladder graph is  equivalent to the grid graph  having two rails and $n$ rungs between them.}

\medskip
External links :

\medskip
\begin{itemize}
\item \href{http://mathworld.wolfram.com/LadderGraph.html}%
           {\textcolor{blue}{MathWorld - LadderGraph}} by %
      \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
           {\textcolor{blue}{Weisstein}}
\end{itemize}
\end{NewMacroBox}

\vfill
\subsubsection{\tkzname{Ladder graph}}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
      \grLadder[RA=2,RS=4]{6}%
\end{tikzpicture}
\end{tkzexample}
\end{center}

\vfill
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<–––––––––––––––––––––––––––  Prism CYCLE LADDER     –––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\newpage 
\subsubsection{Prism graph} 

\begin{NewMacroBox}{grPrism}{\oarg{local options}\var{Number}}
  
\medskip
\begin{tabular}{llc}
 \toprule   
options   & default  & definition                                           \\
\midrule
\TOline{RA      } { |4|    }  {radius  circle n°1  }                             
\TOline{RB      } { |3|    }  {radius  circle n°2  }                             
\TOline{prefix  } { |a|    }  {prefix for vertices }                        
\TOline{prefixx } { |b|    }  {prefix for vertices }                 
\TOline{Math    } { |false|}  {math mode           }    
\bottomrule
\end{tabular}

\medskip
\emph{An $n$-prism graph has $2n$  nodes and $3n$ edges, and is equivalent to the generalized Petersen graph with arguments $n$ and $1$. For odd $n$, the $n$-prism is isomorphic to the circulant graph with an order $2n$ and with arguments $2$ and $n$.\\
The 3-prism graph   is the line graph of the complete bipartite graph with arguments $2$ and $3$ . The 4-prism graph  is isomorphic with the cubical graph.}


\medskip
External links :

\medskip
\begin{itemize}
\item \href{http://mathworld.wolfram.com/PrismGraph.html}%
           {\textcolor{blue}{MathWorld - Prism Graph}} by %
      \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
           {\textcolor{blue}{Weisstein}}
\end{itemize}
\end{NewMacroBox}

\subsubsection{\tkzname{Cycle Ladder graph}}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}[rotate=15,scale=.7]
  \grPrism[RA=6,RB=3]{6}%
\end{tikzpicture}
\end{tkzexample}
\end{center}


\subsubsection{\tkzname{Cycle Ladder graph number 3}}
\begin{center}
\begin{tkzexample}[]
\begin{tikzpicture}[scale=.7]
  \grPrism[RA=6,RB=3]{3}%
\end{tikzpicture}
\end{tkzexample}
\end{center}


\subsubsection{\tkzname{Cycle Ladder graph number 4}}
\begin{center}
\begin{tkzexample}[]
\begin{tikzpicture}[scale=.7] 
  \grPrism[RA=6,RB=3]{4}%
\end{tikzpicture}
\end{tkzexample}
\end{center}


%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<–––––––––––––––––––––––––––––   bipartite ––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\newpage 
\subsubsection{Complete Bipartite graph} 

\begin{NewMacroBox}{grCompleteBipartite}{\oarg{local options}\var{Number 1}\var{Number 2}}

\medskip
\begin{tabular}{llc}
 \toprule   
options   & default  & definition                                           \\
\midrule
\TOline{RA     }{|4|     } {radius  circle n°1}    
\TOline{RB     }{|3|     } {radius  circle n°2 }  
\TOline{RS     }{|1|     } {distance between two lines }
\TOline{form   }{|1|     } {integer to obtain a new embedding of a graph}
\TOline{prefix }{|a|     } {prefix for vertices  }
\TOline{prefixx}{|b|     } {prefix for vertices }
\TOline{Math   }{|false| } {math mode }
\bottomrule
\end{tabular}

\medskip
\emph{A complete bipartite graph is a bipartite graph (i.e., a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent) such that every pair of graph vertices in the two sets are adjacent.}

\medskip
External links :

\medskip
\begin{itemize}
\item \href{http://mathworld.wolfram.com/CompleteBipartiteGraph.html}%
           {\textcolor{blue}{MathWorld - CompleteBipartite Graph}} by %
      \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
           {\textcolor{blue}{Weisstein}}
\end{itemize}
\end{NewMacroBox}   



\subsubsection{\tkzname{Bipartite graph 1,5}}\label{cl17}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
   \grCompleteBipartite[RA=4,RB=2.5,RS=4]{1}{5}
\end{tikzpicture}
\end{tkzexample}
\end{center}

\subsubsection{\tkzname{Bipartite graph 3,5}}\label{bi1}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
   \grCompleteBipartite[RA=4,RB=3,RS=6]{3}{5}
\end{tikzpicture}
\end{tkzexample}
\end{center}

%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\newpage 
\subsubsection{Triangular Grid graph} 


\begin{NewMacroBox}{grTriangularGrid}{\oarg{local options}\var{Number}}

\medskip
\begin{tabular}{llc}
 \toprule   
options   & default  & definition                                           \\
\bottomrule
\TOline{RA    }{|4|    }{distance between two vertices   }
\TOline{form  }{|1|    }{integer to obtain a new embedding of a graph} 
\TOline{prefix}{|a|    }{prefix for vertices }
\TOline{Math  }{|false|}{math mode  }
\bottomrule
\end{tabular}

\emph{\tkzname{Number=$n$} is the number of vertices of the first row then the graph order is $\dfrac{n(n-1)}{2} $.
There are three embeddings. You can use the option \tkzname{form} with an integer between $1$ and $3$.}
\end{NewMacroBox} 

\medskip


\subsubsection{\opt{n=8 order=$28$} form 1}\label{cl18a}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
  \GraphInit[vstyle=Shade]
  \SetVertexLabel
  \grTriangularGrid[prefix=G,Math,RA=1.5]{8}%
\end{tikzpicture}
\end{tkzexample}
\end{center}

\subsubsection{\opt{n=6 order=$15$} form 2}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
  \GraphInit[vstyle=Shade]
  \SetVertexNoLabel
  \grTriangularGrid[RA=2,form=2]{6}%
\end{tikzpicture}
\end{tkzexample}
\end{center}


\subsubsection{\opt{n=6 order=$15$} form 3}
\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}
  \GraphInit[vstyle=Shade]
  \SetVertexNoLabel
  \grTriangularGrid[RA=2,form=3]{6}%
\end{tikzpicture}
\end{tkzexample}
\end{center}
%<––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––>
\newpage 
\subsubsection{\tkzname{LCF Lederberg-Coxeter-Fruchte}}   

\begin{NewMacroBox}{grLCF}{\oarg{RA=\meta{Number}}  \var{List of numbers} \var{Number}}
\emph{LCF = Lederberg-Coxeter-Fruchte (see the link below for some examples).}

\medskip
External links :

\medskip
\begin{itemize}
\item \href{http://mathworld.wolfram.com/LCFNotation.html}%
           {\textcolor{blue}{MathWorld-LCF Notation}} by %
      \href{http://en.wikipedia.org/wiki/Eric_W._Weisstein}%
           {\textcolor{blue}{Weisstein}}
\end{itemize}
\end{NewMacroBox} 


\subsubsection{\tkzname{$\big[2,-2\big]^2$}}

\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}%
       \grLCF[RA=5]{2,-2}{2}%
\end{tikzpicture}
\end{tkzexample}
\end{center}



\subsubsection{\tkzname{$\big[3,-3\big]^4$}}

\begin{center}
\begin{tkzexample}[vbox]
\begin{tikzpicture}%
       \grLCF[RA=5]{3,-3}{4}%
\end{tikzpicture}
\end{tkzexample}
\end{center}

\subsubsection{Ljubljana graph}
From Wikipedia \url{http://en.wikipedia.org/wiki/Ljubljana_graph}

\emph{The Ljubljana graph was first published in 1993 by Brouwer, Dejter and Thomassen.
In 1972, Bouwer was already talking of a 112-vertices edge- but not vertex-transitive cubic graph found by R. M. Foster, but unpublished. Conder, Malnič, Marušič, Pisanski and Potočnik rediscovered this 112-vertices graph in 2002 and named it the Ljubljana graph after the capital of Slovenia. They proved that it was the unique 112-vertices edge- but not vertex-transitive cubic graph and therefore that was the graph found by Foster.} 

It can be   represented in LCF notation as  :

\[ 
\begin{array}{l}
\Big[ 47, -23, -31, 39, 25, -21, -31, -41, 25, 15, 29, -41, -19, 15, -49, 33, 39, -35, -21, 17,\\ -33, 49, 41, 31, -15, -29, 41, 31, -15, -25, 21, 31, -51, -25, 23, 9, -17, 51, 35, -29, 21,\\ -51, -39, 33, -9, -51, 51, -47, -33, 19, 51, -21,29, 21, -31, -39\Big]^2 
\end{array} 
\]   

   
  \begin{center}
\begin{tikzpicture}
\GraphInit[vstyle=Art]
\SetGraphArtColor{black!50}{darkgray}
\tikzset{VertexStyle/.append style = {
                               minimum size         =  3pt}} 
       \grLCF[RA=7]{47, -23, -31, 39, 25, -21, -31, -41, 25, 15, 29, -41, -19, 15, -49, 33, 39, -35, -21, 17, -33, 49, 41, 31, -15, -29, 41, 31, -15, -25, 21, 31, -51, -25, 23, 9, -17, 51, 35, -29, 21, -51, -39, 33, -9, -51, 51, -47, -33, 19, 51, -21, 29, 21, -31, -39}{2}%  
\end{tikzpicture}
\end{center} 

\begin{tkzexample}[code only]
\GraphInit[vstyle=Art]
\SetGraphArtColor{black!50}{darkgray}
\tikzset{VertexStyle/.append style = {
                               minimum size         =  3pt}} 
\begin{tikzpicture}%
 \grLCF[RA=7]{47, -23, -31, 39, 25, -21, -31, -41, 25, 15, 29, -41, -19, 15,%
  -49, 33, 39, -35, -21, 17, -33, 49, 41, 31, -15, -29, 41, 31, -15, -25, 21,%
   31, -51, -25, 23, 9, -17, 51, 35, -29, 21, -51, -39, 33, -9, -51, 51, -47,%
    -33, 19, 51, -21, 29, 21, -31, -39}{2}%    
\end{tikzpicture}
\end{tkzexample} 
\vfill
\endinput