k_corona

k_corona(G, k, core_number=None)

Return the k-crust of G.

The k-corona is the subset of vertices in the k-core which have exactly k neighbours in the k-core.

Parameters :

G : NetworkX graph

A graph or directed graph

k : int

The order of the corona.

core_number : dictionary, optional

Precomputed core numbers for the graph G.

Returns :

G : NetworkX graph

The k-corona subgraph

Raises :

NetworkXError :

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

See also

core_number

Notes

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.

References

[R157]

k -core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects, A. V. Goltsev, S. N. Dorogovtsev, and J. F. F. Mendes, Phys. Rev. E 73, 056101 (2006) http://link.aps.org/doi/10.1103/PhysRevE.73.056101