| Clustering Coefficient |
Article Index for Clustering |
Website Links For Clustering |
Information AboutClustering Coefficient |
| CATEGORIES ABOUT CLUSTERING COEFFICIENT | |
| graph invariants | |
|
Duncan J. Watts and Steven Strogatz (1998) introduced the clustering coefficient Graph measure to determine whether or not a graph is a Small-world Network . First, let us define a graph in terms of a set of Vertices and a set of Edges , where denotes an edge between vertices and . Below we assume , and are members of ''V''. We define the ''neighbourhood'' ''N'' for a vertex as its immediately connected neighbours as follows: |
|
|