A vertex v of a graph G is called groupie if the average degree tv of all neighbors of v in G is not smaller than the average degree tG of G. Every graph contains a groupie vertex; the problem of whether or not every simple graph on ≧2 vertices has at least two groupie vertices turned out to be surprisingly difficult. We present various sufficient conditions for a simple graph to contain at least two groupie vertices. Further, we investigate the function f(n) = max minv (tv/tG), where the maximum ranges over all simple graphs on n vertices, and prove that f(n) = 1/42n + o(1). The corresponding result for multigraphs is in sharp contrast with the above. We also characterize trees in which the local average degree tv is constant.
ASJC Scopus subject areas
- Geometry and Topology