Degree Centrality (Beta)
Degree centrality is defined as the number of edges incident upon a node (i.e., the number of ties that a node has). The degree can be interpreted in terms of the immediate risk of a node for catching whatever is flowing through the network (such as a virus, or some information).
Specification
Parameters
Name | Description | Data type |
| A set of vertex types. |
|
| A set of edge types. |
|
| A set of reverse edge types. If an edge is undirected, put the edge name in the set as well. | ` |
| Boolean value that indicates whether to count the incoming edges as part of a vertex's degree centrality. |
|
| Boolean value that indicates whether to count the outgoing edges as part of a vertex's degree centrality. |
|
| The number of vertices with the highest scores to return. |
|
| If true, print results to JSON output. |
|
| If not empty, save the degree centrality score of each vertex to this attribute. |
|
| If not empty, save results in CSV to this file. |
|
Return value
The vertices with the highest degree centrality scores along with their scores.
Example
Suppose we have the following graph:
Running the query on the graph will show that Dan has the highest degree centrality
Last updated