Abstract
A vertex v of a graph G is called a groupie if its degree is not less than the average of the degrees of its neighbors. In this paper we study the influence of bipartition (B1, B2) on groupies in random bipartite graphs G(B1, B2, p) with both fixed p and p tending to zero.
Author supplied keywords
Cite
CITATION STYLE
APA
Shang, Y. (2010). Groupies in random bipartite graphs. Applicable Analysis and Discrete Mathematics, 4(2), 278–283. https://doi.org/10.2298/AADM100605021S
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free