Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Alliance" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Podbaza

Wyrównaj
Wyświetlanie 1-10 z 158
Tytuł:
Global alliances and independence in trees
Autorzy:
Chellali, Mustapha
Haynes, Teresa
Powiązania:
https://bibliotekanauki.pl/articles/743643.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
defensive alliance
offensive alliance
global alliance
domination
trees
independence number
Opis:
A global defensive (respectively, offensive) alliance in a graph G = (V,E) is a set of vertices S ⊆ V with the properties that every vertex in V-S has at least one neighbor in S, and for each vertex v in S (respectively, in V-S) at least half the vertices from the closed neighborhood of v are in S. These alliances are called strong if a strict majority of vertices from the closed neighborhood of v must be in S. For each kind of alliance, the associated parameter is the minimum cardinality of such an alliance. We determine relationships among these four parameters and the vertex independence number for trees.
Źródło:
Discussiones Mathematicae Graph Theory; 2007, 27, 1; 19-27
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Spectral study of alliances in graphs
Autorzy:
Rodríguez-Velazquez, Juan
Almira, Jose
Powiązania:
https://bibliotekanauki.pl/articles/743723.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
defensive alliance
offensive alliance
dual alliance
domination
spectral radius
graph eigenvalues.
Opis:
In this paper we obtain several tight bounds on different types of alliance numbers of a graph, namely (global) defensive alliance number, global offensive alliance number and global dual alliance number. In particular, we investigate the relationship between the alliance numbers of a graph and its algebraic connectivity, its spectral radius, and its Laplacian spectral radius.
Źródło:
Discussiones Mathematicae Graph Theory; 2007, 27, 1; 143-157
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on global alliances in trees
Autorzy:
Bouzefrane, M.
Chellali, M.
Powiązania:
https://bibliotekanauki.pl/articles/254977.pdf
Data publikacji:
2011
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
global defensive alliance
global offensive alliance
domination
trees
Opis:
For a graph G = (V,E), a set S ⊆ V is a dominating set if every vertex in V - S has at least a neighbor in S. A dominating set S is a global offensive (respectively, defensive) alliance if for each vertex in V - S (respectively, in S) at least half the vertices from the closed neighborhood of v are in S. The domination number γ (G) is the minimum cardinality of a dominating set of G, and the global offensive alliance number γo(G) (respectively, global defensive alliance number γa(G)) is the minimum cardinality of a global offensive alliance (respectively, global deffensive alliance) of G. We show that if T is a tree of order n, then γo(T) ≤ 2γ (T) - 1 and if n ≥ 3, then γo(T) ≤ 3/2?a(T) ? 1. Moreover, all extremal trees attaining the first bound are characterized.
Źródło:
Opuscula Mathematica; 2011, 31, 2; 153-159
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Partner Capabilities and Alliance Time Frame: An Analysis of International Strategic Alliances from the CEE
Autorzy:
Jalali, S. Hossein
Powiązania:
https://bibliotekanauki.pl/articles/475173.pdf
Data publikacji:
2017
Wydawca:
Fundacja Upowszechniająca Wiedzę i Naukę Cognitione
Tematy:
strategic alliance
alliance time frame
partner capabilities
partner selection
Opis:
Partner selection is one of the most discussed issues in strategic alliances literature. However, the majority of research has typically focused on generic partner characteristics and presented conceptual models for alliance partner selection, addressing clan image but only limited pieces of the partner selection puzzle. Rooted in the resource-based view, this paper suggests that partner selection is contingent upon the intended time frame of strategic alliances and presents a new and intensive conceptual framework that examines the appropriate partner capability for strategic alliances, in the case of short/medium-term alliances and long-term ones. Based on empirical evidences from 736 alliances in the CEE region, the findings stress the differences between varied partner capabilities in short/medium-term and long-term alliances. Accordingly, the significance of technological capability increases with the number of year’s alliances endured. Moreover, the importance of market capability decreases significantly when alliances last for a longer time frame.
Źródło:
Journal of Entrepreneurship, Management and Innovation; 2017, 13, 2; 59-76
2299-7075
2299-7326
Pojawia się w:
Journal of Entrepreneurship, Management and Innovation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Offensive alliances in graphs
Autorzy:
Favaron, Odile
Fricke, Gerd
Goddard, Wayne
Hedetniemi, Sandra
Hedetniemi, Stephen
Kristiansen, Petter
Laskar, Renu
Skaggs, R.
Powiązania:
https://bibliotekanauki.pl/articles/744502.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
alliance
offensive
majority
graph
Opis:
A set S is an offensive alliance if for every vertex v in its boundary N(S)- S it holds that the majority of vertices in v's closed neighbourhood are in S. The offensive alliance number is the minimum cardinality of an offensive alliance. In this paper we explore the bounds on the offensive alliance and the strong offensive alliance numbers (where a strict majority is required). In particular, we show that the offensive alliance number is at most 2/3 the order and the strong offensive alliance number is at most 5/6 the order.
Źródło:
Discussiones Mathematicae Graph Theory; 2004, 24, 2; 263-275
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Connected global offensive k-alliances in graphs
Autorzy:
Volkmann, Lutz
Powiązania:
https://bibliotekanauki.pl/articles/743583.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
alliances in graphs
connected global offensive k-alliance
global offensive k-alliance
domination
Opis:
We consider finite graphs G with vertex set V(G). For a subset S ⊆ V(G), we define by G[S] the subgraph induced by S. By n(G) = |V(G) | and δ(G) we denote the order and the minimum degree of G, respectively. Let k be a positive integer. A subset S ⊆ V(G) is a connected global offensive k-alliance of the connected graph G, if G[S] is connected and |N(v) ∩ S | ≥ |N(v) -S | + k for every vertex v ∈ V(G) -S, where N(v) is the neighborhood of v. The connected global offensive k-alliance number $γₒ^{k,c}(G)$ is the minimum cardinality of a connected global offensive k-alliance in G.
In this paper we characterize connected graphs G with $γₒ^{k,c}(G) = n(G)$. In the case that δ(G) ≥ k ≥ 2, we also characterize the family of connected graphs G with $γₒ^{k,c}(G) = n(G) - 1$. Furthermore, we present different tight bounds of $γₒ^{k,c}(G)$.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 4; 699-707
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards a structural understanding of powerbrokers in weak states: From militias to alliances
Autorzy:
Bruchmann, Sascha
Powiązania:
https://bibliotekanauki.pl/articles/1194379.pdf
Data publikacji:
2020
Wydawca:
Akademia Sztuki Wojennej
Tematy:
powerbroker
militia
balance of threat
alliance
anarchy
Opis:
This article aims to contribute to a theoretical understanding and discussion of conflict in weak states. More granular than one at the level of systemic phenomena, this analysis is focused on the actors, and the political structure in weak states. The article aims to improve on efforts to accurately describe these conflicts. After a theoretical introduction, the theorem on powerbroker systems will be applied on the case studies of Afghanistan, Lebanon and Mali. Building on this, the contours of the political system in each case will be highlighted by looking at the very origins of socio-political life. The working hypothesis is that powerbrokers, built on self-governing communities, ally and bandwagon according to Balance of Threat (BoT). This working hypothesis will be tested by examining a derived hypotheses per case study and identifying a) self-rule communities, b) the political-military nexus of powerbrokers within each system, and c) the behaviour of the related BoT alliance. Afghan, Lebanese and Malian powerbrokers all confirm the hypotheses. The powerbrokers originate in a context of self-governing communities trying to maintain their internal autonomy vis-a-vis a more centralised state and world system. During conflict, the communities band together against a perceived external threat, building neo-feudal political-military bodies. Pooling military resources under skilled leadership and privileged access to outside sponsors sparks the birth of a post-conflict politicalmilitary elite. It is beneficial to maintain powerbrokers as they are better suited to distribute resources through patronage at scale. Powerbroker alliances in weak states can be well explained by a theoretical approach based on balance of threat and more research is needed.
Źródło:
Security and Defence Quarterly; 2020, 31, 4; 53-75
2300-8741
2544-994X
Pojawia się w:
Security and Defence Quarterly
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the global offensive alliance number of a tree
Autorzy:
Bouzefrane, M.
Chellali, M.
Powiązania:
https://bibliotekanauki.pl/articles/255263.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
global offensive alliance number
domination number
trees
Opis:
For a graph G = (V, E), a set S ⊆ V is a dominating set if every vertex in V - S has at least a neighbor in S. A dominating set S is a global offensive alliance if for every vertex v in V - S, at least half of the vertices in its closed neighborhood are in S. The domination number ϒ(G) is the minimum cardinality of a dominating set of G and the global offensive alliance number ϒo(G) is the minimum cardinality of a global offensive alliance of G. We first show that every tree of order at least three with l leaves and s support vertices satisfies ϒo(T) ≥ (n - l + s + 1)/3 and we characterize extremal trees attaining this lower bound. Then we give a constructive characterization of trees with equal domination and global offensive alliance numbers.
Źródło:
Opuscula Mathematica; 2009, 29, 3; 223-228
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
POLITYKA BEZPIECZEŃSTWA WEWNĘTRZNEGO GABINETÓW Z UDZIAŁEM SOJUSZU LEWICY DEMOKRATYCZNEJ
INTERIOR SECURITY POLICY OF THE DEMOCRATIC LEFT ALLIANCE
Autorzy:
SPRENGEL, BOLESŁAW
Powiązania:
https://bibliotekanauki.pl/articles/513585.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Rzeszowski. Wydawnictwo Uniwersytetu Rzeszowskiego
Tematy:
Interior security
security policy
Democratic Left Alliance
Opis:
The Democratic Left Alliance implemented an ambitious interior security policy in fighting with corruption and administrative modernization. This programme was only in part of a left-wing nature, but it was also the result of current needs. This program was controlled by journalists, who at times exaggerated its errors and failure.
Źródło:
Polityka i Społeczeństwo; 2014, 12, 3; 106-119 (14)
1732-9639
Pojawia się w:
Polityka i Społeczeństwo
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Countering China: India’s Pacific Predicament
Autorzy:
Bhattacharya, Subhadeep
Powiązania:
https://bibliotekanauki.pl/articles/2092254.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Warszawski. Wydział Nauk Politycznych i Studiów Międzynarodowych
Tematy:
Subhadeep Bhattacharya
Pacific
China
alliance
India
strategy
Opis:
The term 'Indo-Pacific', while mingling the Indian and the Pacific Ocean geopolitics in the 21st century, also attempts to integrate India with the Pacific region geopolitically. India has increasingly integrated economically with the Pacific world since the unveiling of her Look East Policy in 1994, rechristened as the Act East Policy in 2014. Growing hostility between the country and China compelled India to turn to the 'contain China' approach in the Pacific region, which is the cradle of Chinese naval prowess. However, India's deficient naval strength with its focus on the Indian Ocean and her land-oriented security priority amid Chinese and Pakistani threats are major handicaps to India's geo-strategic aspirations in the Pacific region vis-à-vis China's rise. Therefore, India, unable to pursue an offensive realist approach to contain China in the Pacific, has opted for a 'balance of threat' approach, forming alliances with the China-wary countries of the Pacific region, albeit only informally, in order to avoid Chinese retribution.
Źródło:
Stosunki Międzynarodowe - International Relations; 2020, 56, 2; 21-38
0209-0961
Pojawia się w:
Stosunki Międzynarodowe - International Relations
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-10 z 158

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies