What is a k-core in graph theory?

Réponse

A k-core of a graph is a maximal subgraph in which every node has a degree of at least k. The core decomposition of a graph is a nested set of these k-cores.

Did this answer help you?

core

network

See technical action

Other questions about core

What is the purpose of the network.core action? What does the 'direction' parameter control in the core action? How can I handle very large graphs that do not fit into a single machine's memory? What are the main output tables generated by the core action? What information is provided in the 'ProblemSummary' and 'SolutionSummary' results?

This site uses technical and analytical cookies to improve your experience. Read more.