networkx.algorithms.regular.is_regular¶
-
is_regular
(G)[source]¶ Determines whether the graph
G
is a regular graph.A regular graph is a graph where each vertex has the same degree. A regular digraph is a graph where the indegree and outdegree of each vertex are equal.
- Parameters
G (NetworkX graph)
- Returns
Whether the given graph or digraph is regular.
- Return type