k_core(G, k=None, core_number=None)
A k-core is a maximal subgraph that contains nodes of degree k or more.
The main core is the core with the largest degree.
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.
A graph or directed graph
The order of the core. If not specified return the main core.
Precomputed core numbers for the graph G.
The k-core is not defined for graphs with self loops or parallel edges.
The k-core subgraph
Returns the k-core of G.
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