gives the list of vertex in-degrees for all vertices in the graph g.
gives the vertex in-degree for the vertex v.
uses rules vw to specify the graph g.
- The vertex in-degree for a vertex v is the number of incoming directed edges to v.
- For an undirected graph g, an edge is taken to be both an in-edge and an out-edge. »
Examplesopen allclose all
Highlight the vertex in-degree for directed graphs including CycleGraph:
Show the in-degree histogram for BernoulliGraphDistribution[n,p]:
The in-degree distribution follows BinomialDistribution[n-1,p]:
The vertex in-degree distribution for PriceGraphDistribution follows a power-law:
Properties & Relations (10)
Wolfram Research (2010), VertexInDegree, Wolfram Language function, https://reference.wolfram.com/language/ref/VertexInDegree.html (updated 2015).
Wolfram Language. 2010. "VertexInDegree." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/VertexInDegree.html.
Wolfram Language. (2010). VertexInDegree. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/VertexInDegree.html