The vertices for which the strength will be calculated.
mode
Character string, out for out-degree, in for
in-degree or all for the sum of the two. For undirected graphs this
argument is ignored.
loops
Logical; whether the loop edges are also counted.
weights
Weight vector. If the graph has a weight edge
attribute, then this is used by default. If the graph does not have a
weight edge attribute and this argument is NULL, then a
warning is given and
Value
A numeric vector giving the strength of the vertices.
References
Alain Barrat, Marc Barthelemy, Romualdo Pastor-Satorras,
Alessandro Vespignani: The architecture of complex weighted networks, Proc.
Natl. Acad. Sci. USA 101, 3747 (2004)