chordal_cycle_graph(p, create_using=None)
The returned graph is a cycle graph on p nodes with chords joining each vertex :None:None:`x` to its inverse modulo p. This graph is a (mildly explicit) 3-regular expander .
p must be a prime number.
The number of vertices in the graph. This also indicates where the chordal edges in the cycle will be created.
Graph type to create. If graph instance, then cleared before populated.
If :None:None:`create_using` indicates directed or not a multigraph.
The constructed undirected multigraph.
Returns the chordal cycle graph on p nodes.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them