The groupies of random multipartite graphs
Combinatorics
2012-09-18 v1 Probability
Abstract
If a vertex in a graph has degree larger than the average of the degrees of its neighbors, we call it a groupie in . In the current work, we study the behavior of groupie in random multipartite graphs with the link probability between sets of nodes fixed. Our results extend the previous ones on random (bipartite) graphs.
Cite
@article{arxiv.1209.3316,
title = {The groupies of random multipartite graphs},
author = {Marius Portmann and Hongyun Wang},
journal= {arXiv preprint arXiv:1209.3316},
year = {2012}
}
Comments
6 pages