- Tytuł:
- Global offensive k-alliance in bipartite graphs
- Autorzy:
-
Chellali, M.
Volkmann, L. - Powiązania:
- https://bibliotekanauki.pl/articles/255370.pdf
- Data publikacji:
- 2012
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
global offensive k-alliance number
bipartite graphs
trees - Opis:
- Let k ≥ 0 be an integer. A set S of vertices of a graph G = (V (G), E(G)) is called a global offensive k-alliance if /N(v) ∩ S/ ≥ /N(v) - S/ + k for every v ∈ V (G) - S, where 0 ≤ k Δ and Δ is the maximum degree of G. The global offensive k-alliance number [formula] is the minimum cardinality of a global offensive k-alliance in G. We show that for every bipartite graph G and every integer k ≥ 2, [formula], where Lk(G) is the set of vertices of degree at most k - 1. Moreover, extremal trees attaining this upper bound are characterized.
- Źródło:
-
Opuscula Mathematica; 2012, 32, 1; 83-89
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki
Artykuł