The local clustering coefficient of a vertex 
of a graph 
is the fraction of pairs of neighbors of 
that are connected over all pairs of neighbors of 
.
Computation of local clustering coefficients is implemented in the Wolfram
Language as LocalClusteringCoefficient[g].
The average of the local clustering coefficients is known as the mean
clustering coefficient.
See also
Global Clustering Coefficient,
Mean Clustering Coefficient
Explore with Wolfram|Alpha
References
Watts, D. J. and Strogatz, S. "Collective Dynamics
of 'Small-World' Networks." Nature 393, 440-442, 1998.
Cite this as:
Weisstein, Eric W. "Local Clustering Coefficients."
From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/LocalClusteringCoefficients.html
Subject classifications
