Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
k_corona¶

k_corona
(G, k, core_number=None)[source]¶ Return the kcorona of G.
The kcorona is the subgraph of nodes in the kcore which have exactly k neighbours in the kcore.
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 kcorona subgraph
Raises: NetworkXError
The kcornoa is not defined for graphs with self loops or parallel edges.
See also
Notes
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.
References
[R230] 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