Degree
From SONIVIS:Wiki
Degree
|
The Degree of a node is the number of its adjacent nodes.
Objective
The Degree is a very simple measure but it is utilized in other calculations such as Degree Centrality. Basically, the degree of a node is the number of edges which are connected with this node. Based on this measure the activity of a node can be evaluated.
Calculation
Two nodes 
are adjacent, if 
, 
. 
is the network with a set of nodes 
and a set of lines (edges) 
[1]. The set of all neighbors (adjacent nodes) of 
is denoted as degree 
. Equivalently, the degree of a node is the number of edges connecting a node with all its neighbors.
,
where 
is the number of all lines in a network and 
the number of all lines (edges) that connect 
with its neighbors.
A node is isolated if 
[1]. If all nodes of have the same degree k the network is called k-regular or simply regular[1]. A 3-regular network is called cubic.
Statement
| R-example |
| library(igraph) g <- graph.ring(10) degree(g, mode = "total") degree.distribution(g, cumulative = FALSE) |
