This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Return the chordal cycle graph on nodes.
The returned graph is a cycle graph on nodes with chords joining each vertex to its inverse modulo . This graph is a (mildly explicit) 3-regular expander .
pmust be a prime number.
- p (a prime number) – The number of vertices in the graph. This also indicates where the chordal edges in the cycle will be created.
- create_using (graph-like) – A graph-like object that receives the constructed edges. If
None, then a
MultiGraphinstance is used.
G – The constructed undirected multigraph.
If the graph provided in
create_usingis directed or not a multigraph.
 Theorem 4.4.2 in A. Lubotzky. “Discrete groups, expanding graphs and invariant measures”, volume 125 of Progress in Mathematics. Birkhäuser Verlag, Basel, 1994.