International audience
-
1995 (v1)Conference paperUploaded on: December 4, 2022
-
June 1996 (v1)Conference paper
This papers deals with the question of the influence of a monopoly of vertices, seeking to gain the majority in local neighborhoods in a graph. Say that a vertex v is r-controlled by a set of vertices M if the majority of its neighbors at distance r are from M. We ask how large must M be in order to r-monopolize the graph, namely, r-control...
Uploaded on: December 3, 2022 -
May 2003 (v1)Journal article
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...
Uploaded on: December 3, 2022 -
2000 (v1)Journal article
Annular Network AN (c, s) is a graph representing a c × s grid in polar coordinates. We give bounds for the diameter of orientations of AN (c, s) and provide orientations which show that bounds are tight in most cases.
Uploaded on: December 3, 2022