GraphReciprocity
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 allScope (6)
GraphReciprocity works with undirected graphs:
Use rules to specify the graph:
GraphReciprocity works with large graphs:
Applications (3)
GraphReciprocity measures the number of directed edges that are bidirectional:
Test whether a square matrix is structurally symmetric:
Distribution of reciprocity in UniformGraphDistribution[n,m,DirectedEdges->True]:
Text
Wolfram Research (2012), GraphReciprocity, Wolfram Language function, https://reference.wolfram.com/language/ref/GraphReciprocity.html (updated 2015).
CMS
Wolfram Language. 2012. "GraphReciprocity." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/GraphReciprocity.html.
APA
Wolfram Language. (2012). GraphReciprocity. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/GraphReciprocity.html