This function finds the boundary of the rich core of a graph, based on the decreasing order of vertex degree. It also calculates the degree that corresponds to that rank, and the core size relative to the total number of vertices in the graph.

1 | ```
rich.core(g)
``` |

`g` |
An |

A data frame with the following components:

`density` |
The density of the graph. |

`rank` |
The rank of the boundary for the rich core. |

`k.r` |
The degree of the vertex at the boundary. |

`core.size` |
The size of the core relative to the graph size. |

Christopher G. Watson, cgwatson@bu.edu

Ma A \& Mondragon R.J. (2015) *Rich-cores in networks*. PLoS
One, 10(3): e0119678. doi:10.1371/journal.pone.0119678

`rich.club.coeff, rich.club.norm`

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.