compute the local clustering coefficient
(optional) a vertex of G
LocalClusteringCoefficient returns the local clustering coefficient for a specified vertex in the given graph G, or if no vertex is specified, a list of the coefficients for each vertex in G.
The local clustering coefficient is a number between 0 and 1 measuring how close the neighborhood of v is to a clique.
For a node v with n neighbors, the local cluster coefficient is the number of edges between neighbors of v (counting undirected edges twice) and the number n⁢n−1, which is the maximum number of (directed) edges possible between n neighbors.
G ≔ Graph⁡1,2,3,4,5,6,1,3,1,6,2,6,2,4,3,6,4,6,4,5,5,6
G≔Graph 1: an undirected graph with 6 vertices and 8 edge(s)
Compute the clustering coefficient for vertex 6
Produce a list of all local clustering coefficients
The GraphTheory[LocalClusteringCoefficient] command was introduced in Maple 2016.
For more information on Maple 2016 changes, see Updates in Maple 2016.
Download Help Document
What kind of issue would you like to report? (Optional)