These are the values of the clustering coefficient (c) for all networks to which the statistic applies and for which it was computed. In total, it has been computed for 427 networks.
The clustering coefficient (c) equals the probability that a random chosen wedge (i.e., 2-star) is completed by a third edge to form a triangle. Multiple edges, edge directions and loops are not taken into account.
The full definition of the clustering coefficient as well as its properties and relationships to other graph statistics can be found in the KONECT handbook.