gives the reciprocity of a graph g.
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.
Examplesopen allclose all
Introduced in 2012
(9.0)| Updated in 2015