GraphReciprocity

GraphReciprocity[g]

gives the reciprocity of a graph g.

GraphReciprocity[{vw,}]

uses rules vw to specify the graph g.

Details and Options

  • The reciprocity of a graph g is the fraction of reciprocal edges over all edges of g.
  • For a directed graph, the edges and are reciprocal and form a cycle of length 2.
  • For an undirected graph, all edges are reciprocal.
  • GraphReciprocity works with undirected graphs, directed graphs, and weighted graphs.

Examples

open allclose all

Basic Examples  (2)

Compute the reciprocity of a directed graph:

In[1]:=
Click for copyable input
Out[1]=

Distribution of graph reciprocity:

In[1]:=
Click for copyable input
Out[1]=

Scope  (6)

Applications  (3)

Properties & Relations  (3)

See Also

LocalClusteringCoefficient  GlobalClusteringCoefficient

Introduced in 2012
(9.0)
| Updated in 2015
(10.3)