margulis_gabber_galil_graph(n, create_using=None)
The undirected MultiGraph is regular with degree :None:None:`8`. Nodes are integer pairs. The second-largest eigenvalue of the adjacency matrix of the graph is at most :None:None:`5 \sqrt{2}`, regardless of n.
Determines the number of nodes in the graph: :None:None:`n^2`.
Graph type to create. If graph instance, then cleared before populated.
If the graph is directed or not a multigraph.
The constructed undirected multigraph.
Returns the Margulis-Gabber-Galil undirected MultiGraph on :None:None:`n^2` 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