centrality_degree: Degree Centrality

View source: R/centrality.R

centrality_degreeR Documentation

Degree Centrality

Description

Degree centrality counts the edges incident to each node. With mode = "in" it counts incoming edges and with mode = "out" outgoing edges. On an undirected network the three modes agree.

Usage

centrality_degree(x, mode = "all", ...)

centrality_indegree(x, ...)

centrality_outdegree(x, ...)

Arguments

x

Network input accepted by centrality.

mode

For directed networks: "all" (default), "in" or "out".

...

Further arguments to centrality, such as normalized.

Details

Edge weights are ignored; centrality_strength sums them instead. normalized = TRUE divides the scores by their maximum. centrality_indegree() and centrality_outdegree() are the mode = "in" and mode = "out" forms.

Value

A named numeric vector with one score per node, in input node order.

References

Freeman, L. C. (1978). Centrality in social networks conceptual clarification. Social Networks, 1(3), 215-239. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1016/0378-8733(78)90021-7")}.

See Also

centrality_strength, centrality.

Examples

centrality_degree(regulation_net)

cograph documentation built on Nov. 19, 2026, 5:07 p.m.