Temat: Alliance - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Skocz do pozycji: 2.

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ł

Skocz do pozycji: 3.

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ł

Skocz do pozycji: 4.

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ł

Skocz do pozycji: 5.

Tytuł:: Bounds on the global offensive k-alliance number in graphs
Autorzy:: Chellali, Mustapha
Haynes, Teresa
Randerath, Bert
Volkmann, Lutz
Powiązania:: https://bibliotekanauki.pl/articles/744476.pdf
Data publikacji:: 2009
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: global offensive k-alliance number
independence number
chromatic number
Opis:: Let G = (V(G),E(G)) be a graph, and let k ≥ 1 be an integer. A set S ⊆ V(G) is called a global offensive k-alliance if |N(v)∩S| ≥ |N(v)-S|+k for every v ∈ V(G)-S, where N(v) is the neighborhood of v. The global offensive k-alliance number $γₒ^k(G)$ is the minimum cardinality of a global offensive k-alliance in G. We present different bounds on $γₒ^k(G)$ in terms of order, maximum degree, independence number, chromatic number and minimum degree.
Źródło:: Discussiones Mathematicae Graph Theory; 2009, 29, 3; 597-613
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja