Informacja

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

Wyszukujesz frazę "set" wg kryterium: Temat


Tytuł:
$G_δ$-sets in topological spaces and games
Autorzy:
Winfried, Just
Sheepers, Marion
Steprans, Juris
Szeptycki, Paul
Tematy:
game
strategy
Lusin set, Sierpiński set, Rothberger's property C"
concentrated set
λ-set, σ-set
perfectly meager set, Q-set
$s_0$-set
$A_1$-set
$A_2$-set
$A_3$-set
${\ninegot b}$
${\ninegot d}$
Pokaż więcej
Data publikacji:
1997
Powiązania:
https://bibliotekanauki.pl/articles/1205436.pdf  Link otwiera się w nowym oknie
Źródło:
Fundamenta Mathematicae; 1997, 153, 1; 41-58
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Opis:
Players ONE and TWO play the following game: In the nth inning ONE chooses a set $O_n$ from a prescribed family ℱ of subsets of a space X; TWO responds by choosing an open subset $T_n$ of X. The players must obey the rule that $O_n ⊆ O_{n+1} ⊆ T_{n+1} ⊆ T_n$ for each n. TWO wins if the intersection of TWO's sets is equal to the union of ONE's sets. If ONE has no winning strategy, then each element of ℱ is a $G_δ$-set. To what extent is the converse true? We show that:  (A) For ℱ the collection of countable subsets of X:   1. There are subsets of the real line for which neither player has a winning strategy in this game.   2. The statement "If X is a set of real numbers, then ONE does not have a winning strategy if, and only if, every countable subset of X is a $G_δ$-set" is independent of the axioms of classical mathematics.   3. There are spaces whose countable subsets are $G_δ$-sets, and yet ONE has a winning strategy in this game.   4. For a hereditarily Lindelöf space X, TWO has a winning strategy if, and only if, X is countable.  (B) For ℱ the collection of $G_σ$-subsets of a subset X of the real line the determinacy of this game is independent of ZFC.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Independent transversal domination in graphs
Autorzy:
Hamid, Ismail
Tematy:
dominating set
independent set
independent transversal dominating set
Pokaż więcej
Data publikacji:
2012
Powiązania:
https://bibliotekanauki.pl/articles/743635.pdf  Link otwiera się w nowym oknie
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 1; 5-17
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Opis:
A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V-S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by $γ_{it}(G)$. In this paper we begin an investigation of this parameter.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Making a Dominating Set of a Graph Connected
Autorzy:
Li, Hengzhe
Wu, Baoyindureng
Yang, Weihua
Tematy:
independent set
dominating set
connected dominating set
Pokaż więcej
Data publikacji:
2018-11-01
Powiązania:
https://bibliotekanauki.pl/articles/31342251.pdf  Link otwiera się w nowym oknie
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 4; 947-962
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Opis:
Let $ G = (V,E) $ be a graph and $ S \subseteq V $. We say that $ S $ is a dominating set of $ G $, if each vertex in $ V \backlash S $ has a neighbor in $S$. Moreover, we say that $S$ is a connected (respectively, 2-edge connected or 2-connected) dominating set of $G$ if $ G[S] $ is connected (respectively, 2-edge connected or 2-connected). The domination (respectively, connected domination, or 2-edge connected domination, or 2-connected domination) number of $G$ is the cardinality of a minimum dominating (respectively, connected dominating, or 2-edge connected dominating, or 2-connected dominating) set of $G$, and is denoted $ \gamma (G) $ (respectively $ \gamma_1 (G) $, or $ \gamma_2^′ (G) $, or $ \gamma_2 (G) $). A well-known result of Duchet and Meyniel states that $ \gamma_1 (G) \le 3 \gamma (G) − 2 $ for any connected graph $G$. We show that if $ \gamma (G) \ge 2 $, then $ \gamma_2^′ (G) \ge 5 \gamma (G) − 4 $ when $G$ is a 2-edge connected graph and $ \gamma_2 (G) \le 11 \gamma (G) − 13 $ when $G$ is a 2-connected triangle-free graph.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Independent set dominanting sets in bipartite graphs
Autorzy:
Zelinka, B.
Tematy:
set dominanting set
set domination number
independent set
bipartite graph
multihypergraph
Pokaż więcej
Data publikacji:
2005
Powiązania:
https://bibliotekanauki.pl/articles/255203.pdf  Link otwiera się w nowym oknie
Źródło:
Opuscula Mathematica; 2005, 25, 2; 345-349
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Opis:
The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset D of the vertex set V(G) of a graph G is called a set dominating set (shortly sd-set) in G, if for each set X ikkeq V(G) - D there exists a set Y ikkeq D such that the subgraph of G induced X cup Y is connected. The minimum number of vertices of an sd-set in G is called the set domination number gammas (G) of G. An sd-set D in G such that /D/ = gammas(G) is called a gammas-set in G. In this paper we study sd-sets in bipartite graphs which are simultaneously independent. We apply the theory of hypergraphs.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On a question of Sierpiński
Autorzy:
Slaman, Theodore
Tematy:
Borel set
analytic set
Pokaż więcej
Data publikacji:
1999
Powiązania:
https://bibliotekanauki.pl/articles/1205275.pdf  Link otwiera się w nowym oknie
Źródło:
Fundamenta Mathematicae; 1999, 159, 2; 153-159
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Opis:
There is a set U of reals such that for every analytic set A there is a continuous function f which maps U bijectively to A.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Note on the Locating-Total Domination in Graphs
Autorzy:
Miller, Mirka
Rajan, R. Sundara
Jayagopal, R.
Rajasingh, Indra
Manuel, Paul
Tematy:
dominating set
total dominating set
locating-dominating set
locating-total dominating set
regular graphs
Pokaż więcej
Data publikacji:
2017-08-01
Powiązania:
https://bibliotekanauki.pl/articles/31341658.pdf  Link otwiera się w nowym oknie
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 3; 745-754
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Opis:
In this paper we obtain a sharp (improved) lower bound on the locating-total domination number of a graph, and show that the decision problem for the locating-total domination is NP-complete.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Weakly convex and convex domination numbers
Autorzy:
Lemańska, M.
Tematy:
dominating set
connected domination number
distance
isometric set
convex set
Pokaż więcej
Data publikacji:
2004
Powiązania:
https://bibliotekanauki.pl/articles/2050775.pdf  Link otwiera się w nowym oknie
Źródło:
Opuscula Mathematica; 2004, 24, 2; 181-188
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Opis:
Two new domination parameters for a connected graph G: the weakly convex domination number of G and the convex domination number of G are introduced. Relations between these parameters and the other domination parameters are derived. In particular, we study for which cubic graphs the convex domination number equals the connected domination number.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On equality in an upper bound for the acyclic domination number
Autorzy:
Samodivkin, V.
Tematy:
dominating set
acyclic set
independent set
acyclic domination number
Pokaż więcej
Data publikacji:
2008
Powiązania:
https://bibliotekanauki.pl/articles/255046.pdf  Link otwiera się w nowym oknie
Źródło:
Opuscula Mathematica; 2008, 28, 3; 331-334
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Opis:
A subset A of vertices in a graph G is acyclic if the subgraph it induces contains no cycles. The acyclic domination number ϒa (G) of a graph G is the minimum cardinality of an acyclic dominating set of G. For any graph G with n vertices and maximum degree Δ(G), ϒa(G) ≤ n - Δ(G). In this paper we characterize the connected graphs and the connected triangle-free graphs which achieve this upper bound.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Domination, Eternal Domination, and Clique Covering
Autorzy:
Klostermeyer, William F.
Mynhardt, C.M.
Tematy:
dominating set
eternal dominating set
independent set
clique cover
Pokaż więcej
Data publikacji:
2015-05-01
Powiązania:
https://bibliotekanauki.pl/articles/31339487.pdf  Link otwiera się w nowym oknie
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 2; 283-300
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Opis:
Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-eternal domination model. Inequality chains consisting of the domination, eternal domination, m-eternal domination, independence, and clique covering numbers of graph are explored in this paper. Among other results, we characterize bipartite and triangle-free graphs with domination and eternal domination numbers equal to two, trees with equal m-eternal domination and clique covering numbers, and two classes of graphs with equal domination, eternal domination and clique covering numbers.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Proximinality and co-proximinality in metric linear spaces
Autorzy:
Narang, T. W.
Gupta, Sahil
Tematy:
Best approximation
best coapproximation
proximinal set
co-proximinal set
Chebyshev set
co-Chebyshev set
Pokaż więcej
Data publikacji:
2015
Powiązania:
https://bibliotekanauki.pl/articles/747023.pdf  Link otwiera się w nowym oknie
Źródło:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2015, 69, 1
0365-1029
2083-7402
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica
Opis:
As a counterpart to best approximation, the concept of best coapproximation was introduced in normed linear spaces by C. Franchetti and M. Furi in 1972. Subsequently, this study was taken up by many researchers. In this paper, we discuss some results on the existence and uniqueness of best approximation and best coapproximation when the underlying spaces are metric linear spaces.
Dostawca treści:
Biblioteka Nauki
Artykuł

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