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 ?
i])), of a variable is the summation of its indegree (in-arrows) and outdegree (out-arrows)
The sites were then selected according to the following criteria: relevance (measured by indegree within the network), blog stance (activist, scientific, or skeptic), topic (it had to deal mainly with climate issues), language (mainly German), activity (recent news updates), and interactivity (comment sections).
A analise das medidas priorizou a centralidade (entrada) indegree e (saida) outdegree, medidas menos sensiveis para valores faltantes em grupos de dados (Balestrin, Verschoore, & Perucia, 2014).
605 Esperado Fonte: Dados da pesquisa de campo (2014) Quadro 3: Dados de centralidade da rede "pede orientacao" Empresa 1 Empresa 2 OutDegree InDegree OutDegree InDegree Media 7.
structure of nodes and links based on needs and desires Source: Compiled from Several Sources TABLE 2--MOVEMENT AND ORIENTATION IN STRATEGIC AREAS Tourism Strategic Area (Sambas) 1 2 OutDegree inDegree 12 Sambas 961.
El actor indegree es el numero de vinculos entrantes que el actor recibe de otros, lo que indica el numero de riesgo que los lideres nominados recibieron de sus colegas y por lo tanto puede considerarse como una indicacion del grado de popularidad de lider en la toma de riesgos de comportamiento innovador.
The nodes' indegree and outdegree measures are also represented in Figure 1, with the former shown by color and the latter shown by size (the darker the color, the greater the indegree; the larger the size, the greater the outdegree).
85 Or Betterrated Wattage In Watts:11, Colour Temperature Indegree K:6500.
Ao identificar a area de atuacao dos usuarios com indegree maior que cinco (ou seja, pesquisadores mencionados como coautor em outros curriculos em pelo menos cinco ocasioes), apenas 21 de um total de 90 pesquisadores (o equivalente a 23%) listaram a Comunicacao como sua primeira area de atuacao.
An old result of Good (see for instance, [16]) states that a weakly connected multidigraph M has an eulerian circuit if and only if, for every vertex, indegree equals outdegree.
The outdegree od(v) of a point v is the number of points adjacent from it, and the indegree id(v) is the number adjacent to it.