The Power of Small Coalitions in Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1995

The Power of Small Coalitions in Graphs

Résumé

This paper considers the question of the in uence of a coalition of vertices, seeking to gain control (or majority) in local neighborhoods in a general graph. Say that a vertex v is controlled by the coalition M if the majority of its neighbors are from M. We ask how many vertices (as a function of jMj) can M control in this fashion. Upper and lower bounds are provided for this problem, as well as for cases where the majority is computed over larger neighborhoods (either neighborhoods of some xed radius r 1, or all neighborhoods of radii up to r). In particular, we look also at the case where the coalition must control all vertices outside itself, and derive bounds for its size.
Fichier principal
Vignette du fichier
106-BePe95b-coalitions.pdf (211.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03762634 , version 1 (28-08-2022)

Identifiants

  • HAL Id : hal-03762634 , version 1

Citer

Jean-Claude Bermond, David Peleg. The Power of Small Coalitions in Graphs. Proceedings Conference Sirocco1995, International Informatics Series 2, Carleton University Press, 173-184, Jun 1995, Olympie, Greece. ⟨hal-03762634⟩
8 Consultations
11 Téléchargements

Partager

Gmail Facebook X LinkedIn More