Temat: independence number - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Trees with equal 2-domination and 2-independence numbers
Autorzy:: Chellali, Mustapha
Meddah, Nacéra
Powiązania:: https://bibliotekanauki.pl/articles/743338.pdf
Data publikacji:: 2012
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: 2-domination number
2-independence number
trees
Opis:: Let G = (V,E) be a graph. A subset S of V is a 2-dominating set if every vertex of V-S is dominated at least 2 times, and S is a 2-independent set of G if every vertex of S has at most one neighbor in S. The minimum cardinality of a 2-dominating set a of G is the 2-domination number γ₂(G) and the maximum cardinality of a 2-independent set of G is the 2-independence number β₂(G). Fink and Jacobson proved that γ₂(G) ≤ β₂(G) for every graph G. In this paper we provide a constructive characterization of trees with equal 2-domination and 2-independence numbers.
Źródło:: Discussiones Mathematicae Graph Theory; 2012, 32, 2; 263-270
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

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ł

Skocz do pozycji: 3.

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ł

Informacja