clusteringCoefficient -- a method for computing the clustering coefficient of a Graph

Synopsis

Usage:

c = clusteringCoefficient(G, v)

g = clusteringCoefficient(G)
Inputs:
- G, a graph,
- v, a thing, v should be a member of the vertex set of G
Outputs:
- c, an integer, The local clustering coefficient for G relative to v.
- g, an integer, The global clustering coefficient for G.

Description

The clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. The global clustering coefficient gives an overall indication of the interconnectedness of the graph. The local clustering coefficient gives an indication of how embedded a single vertex is in the graph.

i1 : clusteringCoefficient cycleGraph 4

o1 = 0

o1 : QQ

i2 : clusteringCoefficient completeGraph 4

o2 = 1

o2 : QQ

Ways to use clusteringCoefficient :

clusteringCoefficient(Graph)
clusteringCoefficient(Graph,Thing)

For the programmer

The object clusteringCoefficient is a method function.