The mean clustering coefficient of a graph is the average of the local clustering coefficients of .
It is implemented in the Wolfram Language as MeanClusteringCoefficient[g].
The mean clustering coefficient of a graph is the average of the local clustering coefficients of .
It is implemented in the Wolfram Language as MeanClusteringCoefficient[g].
Weisstein, Eric W. "Mean Clustering Coefficient." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MeanClusteringCoefficient.html