indegree

indegree

[′in·di‚grē]
(mathematics)
For a vertex, v, in a directed graph, the number of arcs directed from other vertices to v.
Mentioned in ?
References in periodicals archive ?
The indegree of u [member of] V relative to O, denoted [indeg.
Children classified as secondary/nuclear had significantly higher indegree, or more classmates selecting them as a friend, than those children classified as isolated/peripheral: secondary/nuclear: M(SD) = 3.
Nodes are sized by indegree, meaning larger nodes reflect more incoming social ties around expertise related to research evidence.
81), and indegree of 241 (versus a network average of 12.
After that, we calculated the indegree centrality of each cited author, so that they could be differentiated according the volume of ties they received from the components, indicating their degree of sharing.
In work on social networks, this individual would occupy a position of high indegree centrality (Brass, 1992).
Indegree and outdegree refer to the number of lines directed in towards or away from a point, respectively.
Proposition 35 The common vertices of the associahedron Asso(T) with the parallelepiped Para(T) are precisely the vertices a(S) where S is any orientation of the tree T such that each negative vertex has outdegree at most one while each positive vertex has indegree at most one.
We assume that all sources and sinks have indegree 0 and outdegree 0, respectively.
n,m] may be represented by a directed graph with n vertices of indegree and outdegree 1, consisting of the union of m (directed) cycles of lengths [n.
vertices, each having indegree n and outdegree n, for a total of n