Message-ID: <1554426428.24545.1571811274458.JavaMail.confluence@wiki.cns.iu.edu> Subject: Exported From Confluence MIME-Version: 1.0 Content-Type: multipart/related; boundary="----=_Part_24544_235696747.1571811274458" ------=_Part_24544_235696747.1571811274458 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Content-Location: file:///C:/exported.html Extract K-Core

Extract K-Core

Description
=20

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
Parameters
=20

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

=20
Applications
=20

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

=20
Usage Hints
=20

As 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.

=20
References
=20

B. 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

=20