Client–server and cost effective sets in graphs
For any integer k ≥ 0 , a set of vertices S of a graph G = (V , E) is k -cost-effective if for every v ∈ S , | N (v) ∩ (V ∖ S) | ≥ | N (v) ∩ S | + k . In this paper we study the minimum cardinality of a maximal k -cost-effective set and the maximum cardinality of a k -cost-effective set. We obtain G...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860016300159 |