The groupies of random multipartite graphs

MaRDI QIDQ6235690zbMATH OpenFDO

Authors Marius Portmann, Hongyun Wang

Publication date 14 September 2012

Mathematics Subject Classification ID

Vertex degrees (05C07) Random graphs (graph-theoretic aspects) (05C80)

Abstract: If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. 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.

This page was built for publication: The groupies of random multipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6235690)