Description Usage Arguments Value Author(s)
The k-core of graph is a maximal subgraph in which each vertex has at least degree k. A vertex belongs to the k-th core if has degree >= k when all connected vertices with degree < k are recursively deleted.
1 | fg.kcore(graph, k.start = 2, k.end = 10)
|
graph |
The FlashGraph object |
k.start |
The lowest core that should be computed. Must be >= 2. |
k.end |
The highest core that should be computed. Must be >= 2. default is 10. |
A numeric vector that contains the core of each vertex up to 'k.end'. Vertices in cores higher than 'k.end' will have entries with '-1' as their core.
Disa Mhembere <disa@jhu.edu>
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.