margulis_gabber_galil_graph¶
- margulis_gabber_galil_graph(n, create_using=None)[source]¶
Return the Margulis-Gabber-Galil undirected MultiGraph on
nodes.
The undirected MultiGraph is regular with degree
. Nodes are integer pairs. The second-largest eigenvalue of the adjacency matrix of the graph is at most
, regardless of
.
Parameters: - n (int) – Determines the number of nodes in the graph:
.
- create_using (graph-like) – A graph-like object that receives the constructed edges. If None, then a MultiGraph instance is used.
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: