Client–server and cost effective sets in graphs
For any integer , a set of vertices of a graph is -cost-effective if for every . In this paper we study the minimum cardinality of a maximal -cost-effective set and the maximum cardinality of a -cost-effective set. We obtain Gallai-type results involving the -cost-effective and global -offensive all...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.09.001 |