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ę "trees" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 68
Tytuł:
Arbitrarily vertex decomposable caterpillars with four or five leaves
Autorzy:
Cichacz, Sylwia
Görlich, Agnieszka
Marczyk, Antoni
Przybyło, Jakub
Woźniak, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/743967.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
arbitrarily vertex decomposable graphs
trees
caterpillars
star-like trees
Opis:
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (a₁,...,aₖ) of positive integers such that a₁+...+aₖ = n there exists a partition (V₁,...,Vₖ) of the vertex set of G such that for each i ∈ {1,...,k}, $V_i$ induces a connected subgraph of G on $a_i$ vertices. D. Barth and H. Fournier showed that if a tree T is arbitrarily vertex decomposable, then T has maximum degree at most 4. In this paper we give a complete characterization of arbitrarily vertex decomposable caterpillars with four leaves. We also describe two families of arbitrarily vertex decomposable trees with maximum degree three or four.
Źródło:
Discussiones Mathematicae Graph Theory; 2006, 26, 2; 291-305
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Smallest Harmonic Index of Trees with Given Maximum Degree
Autorzy:
Rasi, Reza
Sheikholeslami, Seyed Mahmoud
Powiązania:
https://bibliotekanauki.pl/articles/31342320.pdf
Data publikacji:
2018-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
harmonic index
trees
Opis:
The harmonic index of a graph G, denoted by H(G), is defined as the sum of weights 2/[d(u) + d(v)] over all edges uv of G, where d(u) denotes the degree of a vertex u. In this paper we establish a lower bound on the harmonic index of a tree T.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 2; 499-513
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on the p-domination number of trees
Autorzy:
Lu, Y.
Hou, X.
Xu, J.-M.
Powiązania:
https://bibliotekanauki.pl/articles/255183.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
p-domination number
trees
Opis:
Let p be a positive integer and G = (V (G), E(G)) a graph. A p-dominating set of G is a subset S of V (G) such that every vertex not in S is dominated by at least p vertices in S. The p-domination number ϒp(G) is the minimum cardinality among the p-dominating sets of G. Let T be a tree with order n ≥ 2 and p ≥ 2 a positive integer. A vertex of V (T) is a p-leaf if it has degree at most p - 1, while a p-support vertex is a vertex of degree at least p adjacent to a p-leaf. In this note, we show that ϒp(T) ≥ (n + /Lp(T)/ - /Sp(T)/)/2, where Lp(T) and Sp(T) are the sets of p-leaves and p-support vertices of T, respectively. Moreover, we characterize all trees attaining this lower bound.
Źródło:
Opuscula Mathematica; 2009, 29, 2; 157-164
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the dominator colorings in trees
Autorzy:
Merouane, Houcine
Chellali, Mustapha
Powiązania:
https://bibliotekanauki.pl/articles/743280.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
dominator coloring
domination
trees
Opis:
In a graph G, a vertex is said to dominate itself and all its neighbors. A dominating set of a graph G is a subset of vertices that dominates every vertex of G. The domination number γ(G) is the minimum cardinality of a dominating set of G. A proper coloring of a graph G is a function from the set of vertices of the graph to a set of colors such that any two adjacent vertices have different colors. A dominator coloring of a graph G is a proper coloring such that every vertex of V dominates all vertices of at least one color class (possibly its own class). The dominator chromatic number $χ_d(G)$ is the minimum number of color classes in a dominator coloring of G. Gera showed that every nontrivial tree T satisfies $γ(T)+1 ≤ χ_d(T) ≤ γ(T)+2$. In this note we characterize nontrivial trees T attaining each bound.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 4; 677-683
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree
Autorzy:
Henning, Michael A.
Marcon, Alister J.
Powiązania:
https://bibliotekanauki.pl/articles/31341173.pdf
Data publikacji:
2016-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination
semitotal domination
trees
Opis:
Let G be a graph with no isolated vertex. In this paper, we study a parameter that is squeezed between arguably the two most important domination parameters; namely, the domination number, γ(G), and the total domination number, γt(G). A set S of vertices in a graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex of S. The semitotal domination number, γt2(G), is the minimum cardinality of a semitotal dominating set of G. We observe that γ(G) ≤ γt2(G) ≤ γt(G). We characterize the set of vertices that are contained in all, or in no minimum semitotal dominating set of a tree.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 1; 71-93
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Graphs with equal domination and 2-distance domination numbers
Autorzy:
Raczek, Joanna
Powiązania:
https://bibliotekanauki.pl/articles/743916.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination number
trees
unicyclic graphs
Opis:
Let G = (V,E) be a graph. The distance between two vertices u and v in a connected graph G is the length of the shortest (u-v) path in G. A set D ⊆ V(G) is a dominating set if every vertex of G is at distance at most 1 from an element of D. The domination number of G is the minimum cardinality of a dominating set of G. A set D ⊆ V(G) is a 2-distance dominating set if every vertex of G is at distance at most 2 from an element of D. The 2-distance domination number of G is the minimum cardinality of a 2-distance dominating set of G. We characterize all trees and all unicyclic graphs with equal domination and 2-distance domination numbers.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 2; 375-385
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Unique Minimum Dominating Sets in Some Cartesian Product Graphs
Autorzy:
Hedetniemi, Jason T.
Powiązania:
https://bibliotekanauki.pl/articles/31339313.pdf
Data publikacji:
2015-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
vertex domination
graph products
trees
Opis:
Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are considered. We first give properties of such sets when they exist. We then show that when the first factor of the product is a tree, consideration of the tree alone is sufficient to determine if the product has a unique minimum dominating set.
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 4; 615-628
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On some families of arbitrarily vertex decomposable spiders
Autorzy:
Juszczyk, T.
Zioło, I. A.
Powiązania:
https://bibliotekanauki.pl/articles/254779.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
arbitrarily vertex decomposable graph
trees
Opis:
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n1, . . . , nk) of positive integers such that [formula], there exists a partition (V1, . . . , Vk) of the vertex set of G such that for every i ∈ {1, . . . , k} the set Vi induces a connected subgraph of G on ni vertices. A spider is a tree with one vertex of degree at least 3. We characterize two families of arbitrarily vertex decomposable spiders which are homeomorphic to stars with at most four hanging edges.
Źródło:
Opuscula Mathematica; 2010, 30, 2; 147-154
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Characterization of trees with equal 2-domination number and domination number plus two
Autorzy:
Chellali, Mustapha
Volkmann, Lutz
Powiązania:
https://bibliotekanauki.pl/articles/743587.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
2-domination number
domination number
trees
Opis:
Let G = (V(G),E(G)) be a simple graph, and let k be a positive integer. A subset D of V(G) is a k-dominating set if every vertex of V(G) - D is dominated at least k times by D. The k-domination number γₖ(G) is the minimum cardinality of a k-dominating set of G. In [5] Volkmann showed that for every nontrivial tree T, γ₂(T) ≥ γ₁(T)+1 and characterized extremal trees attaining this bound. In this paper we characterize all trees T with γ₂(T) = γ₁(T)+2.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 4; 687-697
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Plany zagospodarowania przestrzennego jako instrument zarządzania zieloną infrastrukturą
Land use plans as an instrument for green infrastructure management
Autorzy:
Nowak, Maciej J.
Szulczewska, Barbara
Legutko‑Kobus, Paulina
Giedych, Renata
Oleńczuk-Paszel, Anna
Powiązania:
https://bibliotekanauki.pl/articles/2192755.pdf
Data publikacji:
2023
Wydawca:
Kancelaria Sejmu. Biuro Analiz Sejmowych
Tematy:
green areas
trees
biologically vital area
Opis:
The aim of the article is to present the results of a study on the challenges and barriers related to the role of land use plans in the management of green infrastructure in small and medium-sized cities. This research forms part of a larger project dedicated to analysing the importance of green infrastructure as a natural and social resource of small and medium-sized cities in Poland. The subject of the study are 814 spatial development plans in force in 20 Polish cities (12 medium-sized and 8 small). The selection of these cities was dictated by the assumptions of the research project and related to two basic criteria: the model of the layout of areas covered with vegetation or water and the projected development trajectory. What was analysed in the plans were the patterns of provisions that could be linked to green infrastructure. Provisions concerning green spaces, woodland areas and other specific provisions (which could be linked to green infrastructure) were identified.
Źródło:
Studia BAS; 2023, 1(73); 59-73
2080-2404
2082-0658
Pojawia się w:
Studia BAS
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Trees in the folk tradition of Slavs
Stromy v lidové tradici Slovanů
Autorzy:
Janyšková, Ilona
Powiązania:
https://bibliotekanauki.pl/articles/2084466.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Slavonic studies
folklore
ethnolinguistics
dialectology
trees
Opis:
This review deals with a comprehensive publication on the role of trees in the folk tradition of Slavs. The author of the review appreciates the interdisciplinary focus of the book, which is based on deep knowledge in the field of folklore, Slavonic dialectology and etymology. She also highly values the extremely rich material (folklore, ethnographic and linguistic).
Źródło:
Rocznik Slawistyczny; 2021, 70; 203-207
0080-3588
Pojawia się w:
Rocznik Slawistyczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bounds On The Disjunctive Total Domination Number Of A Tree
Autorzy:
Henning, Michael A.
Naicker, Viroshan
Powiązania:
https://bibliotekanauki.pl/articles/31341124.pdf
Data publikacji:
2016-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
total domination
disjunctive total domination
trees
Opis:
Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $ \gamma_t(G) $. A set $S$ of vertices in $G$ is a disjunctive total dominating set of $G$ if every vertex is adjacent to a vertex of $S$ or has at least two vertices in $S$ at distance 2 from it. The disjunctive total domination number, $ \gamma_t^d (G) $, is the minimum cardinality of such a set. We observe that $ \gamma_t^d (G) \ge \gamma_t (G) $. A leaf of $G$ is a vertex of degree 1, while a support vertex of $G$ is a vertex adjacent to a leaf. We show that if $T$ is a tree of order $n$ with $ \mathcal{l} $ leaves and $s$ support vertices, then $ 2(n−\mathcal{l}+3) // 5 \le \gamma_t^d (T) \le (n+s−1)//2 $ and we characterize the families of trees which attain these bounds. For every tree $T$, we show have $ \gamma_t(T) // \gamma_t^d (T) <2 $ and this bound is asymptotically tight.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 1; 153-171
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Graphs with Unique Maximum Packing of Closed Neighborhoods
Autorzy:
Božović, Dragana
Peterin, Iztok
Powiązania:
https://bibliotekanauki.pl/articles/32304193.pdf
Data publikacji:
2022-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
unique maximum packing
closed neighborhoods
trees
Opis:
A packing of a graph G is a subset P of the vertex set of G such that the closed neighborhoods of any two distinct vertices of P do not intersect. We study graphs with a unique packing of the maximum cardinality. We present several general properties for such graphs. These properties are used to characterize the trees with a unique maximum packing. Two characterizations are presented where one of them is inductive based on five operations.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 3; 779-797
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Arboreal Tradition and Subversion: An Ecocritical Reading of Shakespeare’s Portrayal of Trees, Woods and Forests
Autorzy:
Cossio, Andoni
Simonson, Martin
Powiązania:
https://bibliotekanauki.pl/articles/1033503.pdf
Data publikacji:
2020-06-30
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Shakespeare
trees
woods
forests
ecocriticism
tradition
subversion
Opis:
This paper analyses from an ecocritical standpoint the role of trees, woods and forests and their symbolism in William Shakespeare’s Hamlet, Macbeth, The Merchant of Venice, The Merry Wives of Windsor, A Midsummer Night’s Dream, Richard II and The Tempest. The analysis begins with an outline of the representation of trees on stage to continue with a ‘close reading’ of the mentioned plays, clearly distinguishing individual trees from woods and forests. Individual types of trees may represent death, sadness, sorcery and premonitions, or serve as meeting places, while forests and woods are frequently portrayed as settings which create an atmosphere of confusion, false appearances, danger and magic. This reflects a long-standing historical connection between trees and forests and the supernatural in literature and culture. However, while individual trees largely reflect traditional symbology, conventional interpretations are often subverted in Shakespeare’s treatment of forests and woods. From all this we may infer that Shakespeare was not only familiar with the traditions associated to individual tree species and forests in general, but also that he made conscious and active use of these in order to enhance the meaning of an action, reinforce character traits, further the plot and create a specific atmosphere. More subtly, the collective arboreal environments can also be interpreted as spaces in which superstitions and older societal models are questioned in favour of a more rational and reasonable understanding of the world.
Źródło:
Multicultural Shakespeare: Translation, Appropriation and Performance; 2020, 21, 36; 85-97
2083-8530
2300-7605
Pojawia się w:
Multicultural Shakespeare: Translation, Appropriation and Performance
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ł
Wyświetlanie 1-15 z 68

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