A concept of weighted connectivity on connected graphs

View/Open
Document typeArticle
Defense date2009-02
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
The introduction of a {0,1}-valued game associated to a connected graph allows us to assign to each node a value of weighted connectivity to the different solutions that for the cooperative games are obtained by means of the semivalues. The marginal contributions of each node to the coalitions differentiate an active connectivity from another reactive connectivity, according to whether the node is essential to obtain the connection or it is the obstacle for the connection between the nodes in the coalition. Diverse properties of this concept of connectivity can be derived.
CitationAmer, R.; Giménez, J. A concept of weighted connectivity on connected graphs. "Aplimat : Journal of Applied Mathematics", Febrer 2009, vol. 2, núm. 1, p. 15-21.
ISSN1337-6365
Publisher versionhttp://journal.aplimat.com/
Files | Description | Size | Format | View |
---|---|---|---|---|
Aplimat_Amer_Gimenez.pdf | Article | 132,7Kb | View/Open |