Perform the coreness vector of a graph.
[Kc] = NL_G_Coreness(G)
Graph.
Coreness vector.
NL_G_Coreness performs the coreness vector of the graph G. The k-core of a graph is the subgraph obtained from the original graph after the removal of all nodes of degree
. The node coreness
of a given node is the maximum k such that this node is still present in the k-core, but removed in the k+1-core (WIKIPEDIA).