core_number(G)

A k-core is a maximal subgraph that contains nodes of degree k or more.

The core number of a node is the largest value k of a k-core containing that node.

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.

Parameters

G : NetworkX graph

A graph or directed graph

Raises

NetworkXError

The k-core is not implemented for graphs with self loops or parallel edges.

Returns

core_number : dictionary

A dictionary keyed by node to the core number.

Returns the core number for each vertex.

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 networkx.algorithms.core.k_corona networkx.algorithms.core.k_crust networkx.algorithms.core.k_core networkx.algorithms.core.onion_layers

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#47
type: <class 'function'>
Commit: