networkx.algorithms.core.k_crust

networkx.algorithms.core.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.

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 : NetworkX graph

The k-crust subgraph

Raises :

NetworkXError :

The k-crust is not defined for graphs with self loops or parallel edges.

See also

core_number

Notes

This definition of k-crust is different than the definition in [R75]. The k-crust in [R75] 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 in-degree + out-degree.

References

[R75]

(1, 2, 3) 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