networkx.algorithms.core.k_crust¶

k_crust
(G, k=None, core_number=None)[source]¶ Returns the kcrust of G.
The kcrust is the graph G with the kcore removed.
 Parameters
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.
 Returns
G – The kcrust subgraph
 Return type
NetworkX graph
 Raises
NetworkXError – The kcrust is not implemented for graphs with self loops or parallel edges.
Notes
This definition of kcrust is different than the definition in 1. The kcrust in 1 is equivalent to the k+1 crust of this algorithm.
Not implemented for graphs with parallel edges or self loops.
For directed graphs the node degree is defined to be the indegree + outdegree.
Graph, node, and edge attributes are copied to the subgraph.
See also
References
 1(1,2)
A model of Internet topology using kshell decomposition Shai Carmi, Shlomo Havlin, Scott Kirkpatrick, Yuval Shavitt, and Eran Shir, PNAS July 3, 2007 vol. 104 no. 27 1115011154 http://www.pnas.org/content/104/27/11150.full