|
Calling Sequence
|
|
LCFGraph(jumps, exp)
|
|
Parameters
|
|
jumps
|
-
|
list of integers
|
exp
|
-
|
positive integer
|
|
|
|
|
Description
|
|
•
|
A graph represented by the LCF notation jumps^exp. LCF (Lederberg-Coxeter-Frucht) notation is a convenient notation for the representation of cubic graphs which contain a Hamiltonian cycle.
|
•
|
Note that the LCF encoding of a particular graph need not be unique.
|
|
|
List of LCF graphs
|
|
Name
|
Vertices
|
Edges
|
LCF encoding
|
Bidiakis cube
|
12
|
18
|
[-6,4,-4], 4
|
Duerer graph
|
12
|
18
|
[-4,5,2,-4,-2,5,-5,2,4,-2,-5,4]
|
Franklin graph
|
12
|
18
|
[-5,-3,3,5], 3
|
Frucht graph
|
12
|
18
|
[-5,-2,-4,2,5,-2,2,5,-2,-5,4,2], 1
|
truncated tetrahedron graph
|
12
|
18
|
[2,6,-2], 4
|
Moebius-Kantor graph
|
16
|
24
|
[5,-5], 8
|
Pappus graph
|
18
|
27
|
[5,7,-7,7,-7,-5], 3
|
Desargues graph
|
20
|
30
|
[-9,5,-5,9], 5
|
truncated cube graph
|
24
|
36
|
[2,9,-2,2,-9,-2], 4
|
truncated octahedron graph
|
24
|
36
|
[3,-7,7,-3], 6
|
Nauru graph
|
24
|
36
|
[5,-9,7,-7,9,-5], 4
|
McGee graph
|
24
|
36
|
[12,7,-7], 8
|
F26A graph
|
26
|
39
|
[-7,7], 13
|
(4,6)-cage graph
|
26
|
52
|
[5,9], 13
|
Levi graph
|
30
|
45
|
[-13,-9,7,-7,9,13], 5
|
Dyck graph
|
32
|
48
|
[-13,5,-5,13], 8
|
Gray graph
|
54
|
81
|
[-25,7,-7,13,-13,25], 9
|
truncated icosahedron graph
|
60
|
90
|
[30,-2,2,21,-2,2,12,-2,2,-12,-2,2,-21,-2,2,30,-2,2,-12,-2,2,21,-2,2,-21,-2,2,12,-2,2], 2
|
Foster graph
|
90
|
135
|
[17,-9,37,-37,9,-17], 15
|
Ljubljana graph
|
112
|
168
|
[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
|
generalized hexagon graph
|
126
|
189
|
[17,27,-13,-59,-35,35,-11,13,-53,53,-27,21,57,11,-21,-57,59,-17], 7
|
|
|
|
|
Examples
|
|
|
|
References
|
|
|
Pisanski, Tomaž; Servatius, Brigitte (2013), "2.3.2 Cubic graphs and LCF notation", Configurations from a Graphical Viewpoint, Birkhäuser Advanced Texts Basler Lehrbücher, p.32.
|
|
|
|
|