Extract the k'th k-core from a graph as a separate graph. The k-th k-cor= e is what remains of the graph after every node with fewer than k edges con= nected to it is removed from the graph recursively.

=20**k** =E2=80=93 the k-core to extract

This can be useful in the exploration of a graph to help understand the = graph's structure, often visualizing the extracted k-core.

=20As a k-core might break one component into two or more, it can be useful= to extract the weak components on the result if that occurs in order to in= spect each more closely.

=20B. Bollobas, The evolution of sparse graphs, in Graph Theory and Combina=
torics, Proc. Cambridge Combinatorial Conf. in honor of Paul Erdos, Academi=
c Press, 1984, 35-57. (References: [ALGDOC:1], [ALGDOC:2])

S. B. Seidma=
n, Network structure and minimum degree, Social Networks 5:269-287.

Siz=
e and Connectivity of the k-core of a Random Graph. ?uczak, Tomasz.

Gen=
eralized Cores. V. Batagelj, M. Zaversnik.

k-Core Organization of Compl=
ex Networks. Dorogovtsev, Goltsev, Mendes

The license could not be verified: License Certificate has expired!=20
Generate a Free license now.