# transitivity

0th

Percentile

##### Transitivity of a graph

Transitivity measures the probability that the adjacent vertices of a vertex are connected. This is sometimes also called the clustering coefficient.

Keywords
graphs
##### 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.

• transitivity
##### Examples
g <- graph.ring(10)
transitivity(g)
g2 <- erdos.renyi.game(1000, 10/1000)
transitivity(g2)   # this is about 10/1000
Documentation reproduced from package igraph, version 0.1.2, License: GPL version 2 or later (June, 1991)

### Community examples

Looks like there are no examples yet.