LCF is short for Lederberg-Coxeter-Frucht, it is a concise notation for
3-regular Hamiltonian graphs. It constists of three parameters, the
number of vertices in the graph, a list of shifts giving additional
edges to a cycle backbone and another integer giving how many times
the shifts should be performed. See
http://mathworld.wolfram.com/LCFNotation.html for details.
Usage
graph.lcf(n, shifts, repeats)
Arguments
n
Integer, the number of vertices in the graph.
shifts
Integer vector, the shifts.
repeats
Integer constant, how many times to repeat the shifts.
Value
A graph object.
concept
LCF notation
See Also
graph can create arbitrary graphs, see also the other
functions on the its manual page for creating special graphs.