networkx.generators.expanders.margulis_gabber_galil_graph¶

margulis_gabber_galil_graph
(n, create_using=None)[source]¶ Returns the MargulisGabberGalil undirected MultiGraph on
n^2
nodes.The undirected MultiGraph is regular with degree
8
. Nodes are integer pairs. The secondlargest eigenvalue of the adjacency matrix of the graph is at most5 sqrt{2}
, regardless ofn
.Parameters:  n (int) – Determines the number of nodes in the graph:
n^2
.  create_using (NetworkX graph constructor, optional (default MultiGraph)) – Graph type to create. If graph instance, then cleared before populated.
Returns: G – The constructed undirected multigraph.
Return type: graph
Raises: NetworkXError
– If the graph is directed or not a multigraph. n (int) – Determines the number of nodes in the graph: