Cores, shell indices and the degeneracy of a graph limit
From MaRDI portal
Publication:6301397
arXiv1805.03736MaRDI QIDQ6301397FDOQ6301397
Publication date: 9 May 2018
Abstract: The -core of a graph is the maximal subgraph in which every node has degree at least~, the shell index of a node is the largest such that the -core contains the node, and the degeneracy of a graph is the largest shell index of any node. After a suitable normalization, these three concepts generalize to limits of dense graphs (also called graphons). In particular, the degeneracy is continuous with respect to the cut metric.
This page was built for publication: Cores, shell indices and the degeneracy of a graph limit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301397)
