Abstract.
The introduction of a {0,1}-valued game associated to a connected graph allows us to assign to each vertex a value of weighted connectivity according to the different solutions that for cooperative games are obtained by means of semivalues.
The marginal contributions of each vertex to the coalitions differentiate an active connectivity from another reactive connectivity, according to whether the vertex is essential to obtain the connection or is the obstacle for the connection between the vertices in the coalition. We offer general properties of the connectivity, as well as the behaviour of different families of graphs with regard to this concept. We also analyse the effect on different vertices due to the addition of an edge to the initial graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received: July 2003/Final version received: December 2003
Acknowledgements. Research partially supported by Grant BFM 2003–01314 of the Spanish Ministry of Science and Technology and the European Regional Development Fund.
Rights and permissions
About this article
Cite this article
Amer, R., Giménez, J. A connectivity game for graphs. Math Meth Oper Res 60, 453–470 (2004). https://doi.org/10.1007/s001860400356
Issue Date:
DOI: https://doi.org/10.1007/s001860400356