Transitivity measures the probability that the adjacent
vertices of a vertex are connected. This is sometimes also called the
clustering coefficient.
Usage
transitivity(graph, type="undirected")
Arguments
graph
The graph to analyze.
type
The type of the transitivity to calculate. Possible
values: undirected calculates the global transitivity of an
undirected graph (directed graphs are considered as undirected ones
as well). This is simply the rati
Value
For undirected a single number, or NaN if there are no
connected triples in the graph.
References
Wasserman, S., and Faust, K. (1994). Social Network
Analysis: Methods and Applications. Cambridge: Cambridge University
Press.