Description Usage Arguments Details Value Author(s) Examples
Returns the clustering coefficients of the vertices in a graph.
1 
model 

edges 
matrix with 2 columns, each row representing one edge, and each column one of the vertices in the edge. Column 1 contains the vertex with lower index. 
p 
number of vertices. If 
The clustering coefficient is given by C_i=2*e_i/(k_i*(k_i1))
, where
k_i
is the number of neighbours the vertex i
has, and e_i
is the number of edges between the neighbours of i
.
A vector with length p
with the clustering coefficient of each vertex.
Gabriel Coelho Goncalves de Abreu ([email protected])
1 2 3 4 5 
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.