Temat: trees - Prolib Integro

Skocz do pozycji: 1.

Tytuł:: Oliwka europejska (Olea europaea) – najdłużej żyjący organizm w śródziemnomorskiej Europie
European olive (Olea europaea) – the longest living organism in Mediterranean Europe
Autorzy:: Boratyński, Adam
Boratyńska, Krystyna
Borkowski, Krzysztof
Tematy:: olive trees
monumental trees
Mediterranean basin; Pokaż więcej
Wydawca:: Polskie Towarzystwo Dendrologiczne
Powiązania:: https://bibliotekanauki.pl/articles/1196168.pdf Link otwiera się w nowym oknie
Opis:: Olea europaea is the most emblematic tree of the Mediterranean region. It has been cultivated for about 6000 years for its fruit, oil, wood, and for medicinal and cultural purposes. The research data concerns the monumental olive trees in the region. The oldest and biggest known trees are in Lebanon, Israel, Greece, Albania and Italy. The oldest of those, ‘Sisters of Noahʼ (Lebanon) are believed to be 5000–6000 years old. The most numerous groups of monumental olives were reported from Apulia in Italy and Albania. The oldest and biggest olive trees could be remnants of ancient plantations from the Hellenic and Roman times, but this hypothesis should be confirmed in a detailed study.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: On Independent [1, 2]-Sets in Trees
Autorzy:: Aleid, Sahar A.
Cáceres, José
Puertas, María Luz
Tematy:: domination
independence
spanning trees
excellent trees; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31342284.pdf Link otwiera się w nowym oknie
Opis:: An [1, k]-set S in a graph G is a dominating set such that every vertex not in S has at most k neighbors in it. If the additional requirement that the set must be independent is added, the existence of such sets is not guaranteed in every graph. In this paper we solve some problems previously posed by other authors about independent [1, 2]-sets. We provide a necessary condition for a graph to have an independent [1, 2]-set, in terms of spanning trees, and we prove that this condition is also sufficient for cactus graphs. We follow the concept of excellent tree and characterize the family of trees such that any vertex belongs to some independent [1, 2]-set. Finally, we describe a linear algorithm to decide whether a tree has an independent [1, 2]-set. This algorithm can be easily modified to obtain the cardinality of a smallest independent [1, 2]-set of a tree.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Completely Independent Spanning Trees in (Partial) k-Trees
Autorzy:: Matsushita, Masayoshi
Otachi, Yota
Araki, Toru
Tematy:: completely independent spanning trees
partial k-trees; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31339419.pdf Link otwiera się w nowym oknie
Opis:: Two spanning trees T₁ and T₂ of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T₁ and T₂ are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that ⌈k/2⌉ ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {⌈k/2⌉, . . ., k − 1}, there exist infinitely many k-trees G such that cist(G) = p. Finally we consider algorithmic aspects for computing cist(G). Using Courcelle’s theorem, we show that there is a linear-time algorithm that computes cist(G) for a partial k-tree, where k is a fixed constant.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: European silver fir - an alternative for the dying Norway spruce in Bialowieza Forest?
Autorzy:: Marozau, Aleh
Mielcarek, Miłosz
Krok, Grzegorz
Paluch, Rafał
Chilinski, Krzysztof
Tematy:: artificial origin
old trees
adult generation
trees conditions; Pokaż więcej
Wydawca:: Instytut Badawczy Leśnictwa
Powiązania:: https://bibliotekanauki.pl/articles/2041262.pdf Link otwiera się w nowym oknie
Opis:: The condition of Norway spruce (Picea abies (L.) Karst) in the Białowieża Forest is categorized as a crisis. It is believed that due to the cooling in the Holocene, the then-relict species of the forest, silver fir (Abies alba Mill.), disappeared from its ecosystems and then spruce appeared. Today’s climate change presents challenges to our civilization, including to forestry. However, there is no information at all about how this affected the silver fir in the Białowieża Forest. In the Polish part of the forest (subcompartment 498 Сi, Białowieża Forest District), for the first time a comprehensive study has been carried out on the condition of mature fir trees planted by man and on their progeny. The results indicate high forestry-taxation indicators of trees, resistance to the abiotic factor and competitiveness. Their constitution corresponds to local environmental conditions. However, the disproportionately small number of adult natural regeneration of old firs indicated some kind of malfunction in the mechanism of natural generational change.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: European silver fir – an alternative for the dying Norway spruce in Białowieża Forest?
Autorzy:: Paluch, Rafał
Mielcarek, Miłosz
Marozau, Aleh
Chiliński, Krzysztof
Krok, Grzegorz
Wydawca:: Committee on Forestry Sciences and Wood Technology of the Polish Academy of Sciences and the Forest Research Institute in Sękocin Stary
Cytata wydawnicza:: Marozau A.,Mielcarek M.,Krok G.,Paluch R. and Chiliński K. (2021) European silver fir – an alternative for the dying Norway spruce in Białowieża Forest?. Folia Forestalia Polonica, Series A - Forestry, Vol.63 (Issue 2), pp. 150-166. https://doi.org/10.2478/ffp-2021-0016
Opis:: The condition of Norway spruce (Picea abies (L.) Karst) in the Białowieża Forest is categorized as a crisis. It is believed that due to the cooling in the Holocene, the then-relict species of the forest, silver fir (Abies alba Mill.), disappeared from its ecosystems and then spruce appeared. Today’s climate change presents challenges to our civilization, including to forestry. However, there is no information at all about how this affected the silver fir in the Białowieża Forest. In the Polish part of the forest (subcompartment 498 Сi, Białowieża Forest District), for the first time a comprehensive study has been carried out on the condition of mature fir trees planted by man and on their progeny. The results indicate high forestry-taxation indicators of trees, resistance to the abiotic factor and competitiveness. Their constitution corresponds to local environmental conditions. However, the disproportionately small number of adult natural regeneration of old firs indicated some kind of malfunction in the mechanism of natural generational change.
Dostawca treści:: Repozytorium Centrum Otwartej Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: Trips : towards the trees
Wycieczki : ku drzewom
Autorzy:: Lebda, Małgorzata
Dostawca treści:: Repozytorium Uniwersytetu Jagiellońskiego

Artykuł

na półce

Skocz do pozycji: 7.

Tytuł:: Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
Autorzy:: Azarija, Jernej
Tematy:: Cartesian product graphs
spanning trees
number of spanning trees
inequality; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/30098147.pdf Link otwiera się w nowym oknie
Opis:: Let $ G_1 $ and $ G_2 $ be simple graphs and let $ n_1 = |V (G_1)| $, $ m_1 = |E(G_1)| $ , $ n_2 = |V (G_2)|$ and $ m_2 = |E(G_2)|$. In this paper we derive sharp upper and lower bounds for the number of spanning trees $ \tau $ in the Cartesian product $ G_1 \square G_2 $ of $ G_1 $ and $ G_2 $. We show that: $$ \tau (G_1 \square G_2 ) \geq \frac{2(n_1-1)(n_2-1)}{n_1 n_2} (\tau (G_1) n_1 )^\frac{n_2+1}{2} (\tau(G_2)n_2)^\frac{n_1+1}{2} $$ and $$ \tau(G_1 \square G_2 ) \leq \tau (G_1) \tau (G_2) \left[ \frac{2m_1}{n_1-1} + \frac{2m_2}{n_2-1} \right]^{(n_1 - 1)(n_2 -1)} . $$ We also characterize the graphs for which equality holds. As a by-product we derive a formula for the number of spanning trees in $ K_{n_1} \square K_{n_2} $ which turns out to be $ n_1^{n_1-2} n_2^{n_2-2} (n_1 + n_2 )^{(n_1-1)(n_2-1)} $.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 8.

Tytuł:: Arbitrarily vertex decomposable caterpillars with four or five leaves
Autorzy:: Cichacz, Sylwia
Görlich, Agnieszka
Marczyk, Antoni
Przybyło, Jakub
Woźniak, Mariusz
Tematy:: arbitrarily vertex decomposable graphs
trees
caterpillars
star-like trees; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/743967.pdf Link otwiera się w nowym oknie
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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 9.

Tytuł:: The Smallest Harmonic Index of Trees with Given Maximum Degree
Autorzy:: Rasi, Reza
Sheikholeslami, Seyed Mahmoud
Tematy:: harmonic index
trees; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31342320.pdf Link otwiera się w nowym oknie
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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 10.

Tytuł:: Extensions of the minimum labelling spanning tree problem
Autorzy:: Cerulli, R.
Fink, A.
Gentili, M.
Voss, S.
Tematy:: network design
metaheuristics
spanning trees
labelling trees
Steiner tree problem; Pokaż więcej
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Powiązania:: https://bibliotekanauki.pl/articles/308930.pdf Link otwiera się w nowym oknie
Opis:: In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic vertices), we look for a connected subgraph of G with the minimum number of different colors covering all the basic vertices. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity by means of homogeneous connections. Numerical results for several metaheuristics to solve the problem are presented.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "trees" wg kryterium: Temat