k_crust(G, k=None, core_number=None)¶
Return the k-crust of G.
The k-crust is the graph G with the k-core removed.
- G (NetworkX graph) – A graph or directed graph.
- k (int, optional) – The order of the shell. If not specified return the main crust.
- core_number (dictionary, optional) – Precomputed core numbers for the graph G.
G – The k-crust subgraph
NetworkXError– The k-crust is not defined for graphs with self loops or parallel edges.
Not implemented for graphs with parallel edges or self loops.
For directed graphs the node degree is defined to be the in-degree + out-degree.
Graph, node, and edge attributes are copied to the subgraph.
 (1, 2) A model of Internet topology using k-shell decomposition Shai Carmi, Shlomo Havlin, Scott Kirkpatrick, Yuval Shavitt, and Eran Shir, PNAS July 3, 2007 vol. 104 no. 27 11150-11154 http://www.pnas.org/content/104/27/11150.full