Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

# robins_alexander_clustering¶

robins_alexander_clustering(G)[source]

Compute the bipartite clustering of G.

Robins and Alexander [1] defined bipartite clustering coefficient as four times the number of four cycles $$C_4$$ divided by the number of three paths $$L_3$$ in a bipartite graph:

$CC_4 = \frac{4 * C_4}{L_3}$
Parameters: G (graph) – a bipartite graph clustering – The Robins and Alexander bipartite clustering for the input graph. float

Examples

>>> from networkx.algorithms import bipartite
>>> G = nx.davis_southern_women_graph()
>>> print(round(bipartite.robins_alexander_clustering(G), 3))
0.468


latapy_clustering(), square_clustering()