networkx 2.8.2 Pypi GitHub Homepage
Other Docs
NotesParametersRaisesReturnsBackRef
k_corona(G, k, core_number=None)

The k-corona is the subgraph of nodes in the k-core which have exactly k neighbours in the k-core.

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.

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.

Raises

NetworkXError

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

Returns

G : NetworkX graph

The k-corona subgraph

Returns the k-corona of G.

See Also

core_number

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.core.k_shell

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them


GitHub : /networkx/algorithms/core.py#327
type: <class 'function'>
Commit: