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).
The vertices with the highest degree centrality scores along with their scores.
Suppose we have the following graph:
Running the query on the graph will show that Dan has the highest degree centrality
Name
Description
Data type
v_type
A set of vertex types.
SET<STRING>
e_type
A set of edge types.
SET<STRING>
re_type
A set of reverse edge types. If an edge is undirected, put the edge name in the set as well.
`SET<STRING>
in_degree
Boolean value that indicates whether to count the incoming edges as part of a vertex's degree centrality.
BOOL
out_degree
Boolean value that indicates whether to count the outgoing edges as part of a vertex's degree centrality.
BOOL
top_k
The number of vertices with the highest scores to return.
INT
print_accum
If true, print results to JSON output.
BOOL
result_attr
If not empty, save the degree centrality score of each vertex to this attribute.
STRING
file_attr
If not empty, save results in CSV to this file.
STRING