Groupies in random graphs

W. Fernandez de la Vega, Z. Tuza

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A groupie in a graph G is a vertex whose valency is not less than the average of the valencies of its neighbours. We show that in a random graph, the proportion of the vertices which are groupies is almost always very near to 1/2.

Original languageEnglish
Pages (from-to)339-340
Number of pages2
JournalInformation Processing Letters
Volume109
Issue number7
DOIs
Publication statusPublished - Mar 16 2009

Fingerprint

Random Graphs
Proportion
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Signal Processing
  • Theoretical Computer Science

Cite this

Groupies in random graphs. / de la Vega, W. Fernandez; Tuza, Z.

In: Information Processing Letters, Vol. 109, No. 7, 16.03.2009, p. 339-340.

Research output: Contribution to journalArticle

de la Vega, W. Fernandez ; Tuza, Z. / Groupies in random graphs. In: Information Processing Letters. 2009 ; Vol. 109, No. 7. pp. 339-340.
@article{38532c3d50cf444dab4bed45cdd05f98,
title = "Groupies in random graphs",
abstract = "A groupie in a graph G is a vertex whose valency is not less than the average of the valencies of its neighbours. We show that in a random graph, the proportion of the vertices which are groupies is almost always very near to 1/2.",
author = "{de la Vega}, {W. Fernandez} and Z. Tuza",
year = "2009",
month = "3",
day = "16",
doi = "10.1016/j.ipl.2008.09.015",
language = "English",
volume = "109",
pages = "339--340",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "7",

}

TY - JOUR

T1 - Groupies in random graphs

AU - de la Vega, W. Fernandez

AU - Tuza, Z.

PY - 2009/3/16

Y1 - 2009/3/16

N2 - A groupie in a graph G is a vertex whose valency is not less than the average of the valencies of its neighbours. We show that in a random graph, the proportion of the vertices which are groupies is almost always very near to 1/2.

AB - A groupie in a graph G is a vertex whose valency is not less than the average of the valencies of its neighbours. We show that in a random graph, the proportion of the vertices which are groupies is almost always very near to 1/2.

UR - http://www.scopus.com/inward/record.url?scp=59549083562&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=59549083562&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2008.09.015

DO - 10.1016/j.ipl.2008.09.015

M3 - Article

AN - SCOPUS:59549083562

VL - 109

SP - 339

EP - 340

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 7

ER -