is_regular#
- is_regular(G)[source]#
Determines whether the graph
Gis 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:
- GNetworkX graph
- Returns:
- bool
Whether the given graph or digraph is regular.
Examples
>>> G = nx.DiGraph([(1, 2), (2, 3), (3, 4), (4, 1)]) >>> nx.is_regular(G) True ----
Additional backends implement this function
graphblas : OpenMP-enabled sparse linear algebra backend.