- Tytuł:
- The complexity of open k-monopolies in graphs for negative k
- Autorzy:
- Peterin, Iztok
- Powiązania:
- https://bibliotekanauki.pl/articles/255938.pdf
- Data publikacji:
- 2019
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
open k-monopolies
complexity
total domination - Opis:
- Let G be a graph with vertex set V(G), δ (G) minimum degree of G and [formula]. Given a nonempty set M ⊆ V(G) a vertex v of G is said to be k-controlled by M if [formula] where δM(v) represents the number of neighbors of v in M. The set M is called an open k-monopoly for G if it fc-controls every vertex v of G. In this short note we prove that the problem of computing the minimum cardinality of an open k-monopoly in a graph for a negative integer k is NP-complete even restricted to chordal graphs.
- Źródło:
-
Opuscula Mathematica; 2019, 39, 3; 425-431
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki
Artykuł