Andrew D. answered 07/16/21
Bachelor's degree in mathematics with coursework in discrete math
Are you specifically talking about local clustering coefficient or global?
At any rate, the clustering coefficient is a sort of measure of connectedness or completeness. The local coefficient is literally the proportion of neighbor vertices to a chosen vertex that have connections between them. That is, it gives a ratio of actual connections between neighbor vertices to possible connections between those nodes. The higher the coefficient (up to 1), the closer a graph (or neighborhood) gets to being complete.
A coefficient of 0 means that none of the neighbor vertices to the chosen vertex are connected to each other whereas a coefficient of 1 means that the neighborhood is a clique (all vertices are connected to all other in the neighborhood).