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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 25
Tytuł:
Using FORDRY model to forecast transformation of Norway spruce (Picea abies (L.) Karst.) stands in Nadsyansky Regional Landscape Park (Ukrainian Carpathians)
Autorzy:
Kozak, Ihor
Parpan, Taras
Shparyk, Yuriy
Mylenka, Myroslava
Kozak-Balaniuk, Iryna
Powiązania:
https://bibliotekanauki.pl/articles/2041033.pdf
Data publikacji:
2021
Wydawca:
Instytut Badawczy Leśnictwa
Tematy:
spruce forest decline
tree biomass
tree number
species composition
prediction
simulation experiment
gap model
Opis:
The aim of this study was to simulate transformation of species composition, biomass and number of treesin spruce stands depending on a possible combination of cutting and planting scenarios as well as climate changes. The FORDRY computer model was used to predict the dynamics of Norway spruce (Picea abies (L.) Karst.) stands in Nadsyansky Regional Landscape Park in the Ukrainian Carpathians. Potential changes in species composition, biomass and number of trees were forecasted for the next 50 years. Four scenarios, first – warm-dry, second – cutting dead spruce trees, third – cutting all trees andfourth – planting, were compared to the control one. The analysis revealed a rapid decrease of stand biomass in the first decade as a result of spruce decline. The model predicts an increase in beech biomass before the 50th year of simulation in all scenarios. In the planting scenario, the biomass of beech increased up to 199.9 ± 6.9 t·ha-1 in the 50th year. Correlation analysis showed weak autocorrelations of spruce and negative cross-correlations of spruce with the total stand in control and other scenarios. The output of performed simulations is supported with field and literature data. Results of this study can be applied in the long-term planning of the management and conservation activities in this region. The application of FORDRY model was found useful for analysing the potential scenarios of spruce stand transformation in Nadsyansky Regional Landscape Park.
Źródło:
Folia Forestalia Polonica. Series A . Forestry; 2021, 63, 3; 183-194
0071-6677
Pojawia się w:
Folia Forestalia Polonica. Series A . Forestry
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Accuracy of tree height estimation based on LIDAR data analysis
Autorzy:
Sterenczak, K.
Zasada, M.
Powiązania:
https://bibliotekanauki.pl/articles/38315.pdf
Data publikacji:
2011
Wydawca:
Instytut Badawczy Leśnictwa
Tematy:
laser scanning
forest inventory
LIDAR laser scanner
data analysis
segmentation
tree number
Opis:
Some modern remote sensing technologies, including LIDAR (LIght Detection And Ranging), have significantly developed recently. Laser scanners mounted on the airborne platform make it possible to collect very precise information over large areas, including tree and stand heights. A literature review shows that the model-based method of tree height determination underestimates this parameter in comparison to field measurements. The objective of the study was to analyze accuracy of the automatic height estimation of Scots pine stands, based on the airborne laser scanning data and the example of the Milicz Forest District. Applied algorithm of the stand segmentation into individual trees gave systematic and significant underestimation of the number of trees. The minimum tree height was estimated with a large negative error reaching up to several meters. The maximum mean and top heights were determined more precisely, with a small negative error of a few percent. The sum of tree heights was determined with an error exceeding 40%, which is caused mostly by the error in estimation of the number of trees.
Źródło:
Folia Forestalia Polonica. Series A . Forestry; 2011, 53, 2
0071-6677
Pojawia się w:
Folia Forestalia Polonica. Series A . Forestry
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tree domatic number in graphs
Autorzy:
Chen, X. G.
Powiązania:
https://bibliotekanauki.pl/articles/255594.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
tree domatic number
regular graph
planar graph
Cartesian product
Opis:
A dominating set S in a graph G is a tree dominating set of G if the subgraph induced by S is a tree. The tree domatic number of G is the maximum number of pairwise disjoint tree dominating sets in V(G). First, some exact values of and sharp bounds for the tree domatic number are given. Then, we establish a sharp lower bound for the number of edges in a connected graph of given order and given tree domatic number, and we characterize the extremal graphs. Finally, we show that a tree domatic number of a planar graph is at most 4 and give a characterization of planar graphs with the tree domatic number 3.
Źródło:
Opuscula Mathematica; 2007, 27, 1; 5-11
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Assessment of the natural resources of European silver fir (Abies alba Mill.) in the Polish Sudety Mts.
Autorzy:
Filipiak, M
Barzdajn, W.
Powiązania:
https://bibliotekanauki.pl/articles/41000.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Dendrologii PAN
Tematy:
Sudetes Mountains
Polska
natural resource
European silver fir
Abies alba
locality number
tree number
distribution
restitution
protection strategy
Opis:
Data from floristic publications, forest management records, comprehensive questionnaires and original field research were used to assess the silver fir resources in the Sudety Mts. Fir trees older than 50 years were recorded in over 2000 localities but the mean number of individuals per locality was only about 15. The generally low number of fir trees and their considerable dispersion are the major causes of the poor reproduction of the studied species in the Sudety Mts. In that region, silver fir should receive special treatment and, if possible, excluded from logging plans. Current and projected activities concerned with fir protection are described briefly.
Źródło:
Dendrobiology; 2004, 51; 19-24
1641-1307
Pojawia się w:
Dendrobiology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Lower bound on the domination number of a tree
Autorzy:
Lemańska, Magdalena
Powiązania:
https://bibliotekanauki.pl/articles/744457.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination number
tree
Opis:
>We prove that the domination number γ(T) of a tree T on n ≥ 3 vertices and with n₁ endvertices satisfies inequality γ(T) ≥ (n+2-n₁)/3 and we characterize the extremal graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2004, 24, 2; 165-169
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Turán Number of the Graph 2P5
Autorzy:
Bielak, Halina
Kieliszek, Sebastian
Powiązania:
https://bibliotekanauki.pl/articles/31340814.pdf
Data publikacji:
2016-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
forest
tree
Turán number
Opis:
We give the Turán number ex (n, 2P5) for all positive integers n, improving one of the results of Bushaw and Kettle [Turán numbers of multiple paths and equibipartite forests, Combininatorics, Probability and Computing, 20 (2011) 837-853]. In particular we prove that ex (n, 2P5) = 3n−5 for n ≥ 18.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 3; 683-694
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Accurate Domination in Graphs
Autorzy:
Cyman, Joanna
Henning, Michael A.
Topp, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/31343372.pdf
Data publikacji:
2019-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination number
accurate domination number
tree
corona
Opis:
A dominating set of a graph G is a subset D ⊆ VG such that every vertex not in D is adjacent to at least one vertex in D. The cardinality of a smallest dominating set of G, denoted by γ(G), is the domination number of G. The accurate domination number of G, denoted by γa(G), is the cardinality of a smallest set D that is a dominating set of G and no |D|-element subset of VG \ D is a dominating set of G. We study graphs for which the accurate domination number is equal to the domination number. In particular, all trees G for which γa(G) = γ(G) are characterized. Furthermore, we compare the accurate domination number with the domination number of different coronas of a graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2019, 39, 3; 615-627
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Trees with equal total domination and total restrained domination numbers
Autorzy:
Chen, Xue-Gang
Shiu, Wai
Chen, Hong-Yu
Powiązania:
https://bibliotekanauki.pl/articles/743513.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
total domination number
total restrained domination number
tree
Opis:
For a graph G = (V,E), a set S ⊆ V(G) is a total dominating set if it is dominating and both ⟨S⟩ has no isolated vertices. The cardinality of a minimum total dominating set in G is the total domination number. A set S ⊆ V(G) is a total restrained dominating set if it is total dominating and ⟨V(G)-S⟩ has no isolated vertices. The cardinality of a minimum total restrained dominating set in G is the total restrained domination number. We characterize all trees for which total domination and total restrained domination numbers are the same.
Źródło:
Discussiones Mathematicae Graph Theory; 2008, 28, 1; 59-66
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Gaps in the Saturation Spectrum of Trees
Autorzy:
Horn, Paul
Gould, Ronald J.
Jacobson, Michael S.
Thomas, Brent J.
Powiązania:
https://bibliotekanauki.pl/articles/31343596.pdf
Data publikacji:
2019-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
saturation spectrum
tree
saturation number
Opis:
A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from the complement of G to G results in a copy of H. The minimum number of edges (the size) of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum size is the well studied extremal number, ex(n,H). The saturation spectrum for a graph H is the set of sizes of H-saturated graphs between sat(n,H) and ex(n,H). In this paper we show that paths, trees with a vertex adjacent to many leaves, and brooms have a gap in the saturation spectrum.
Źródło:
Discussiones Mathematicae Graph Theory; 2019, 39, 1; 157-170
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bounds on the Locating Roman Domination Number in Trees
Autorzy:
Jafari Rad, Nader
Rahbani, Hadi
Powiązania:
https://bibliotekanauki.pl/articles/16647912.pdf
Data publikacji:
2018-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Roman domination number
locating domination number
locating Roman domination number
tree
Opis:
A Roman dominating function (or just RDF) on a graph G = (V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF f is the value f(V (G)) = ∑u∈V(G) f(u). An RDF f can be represented as f = (V0, V1, V2), where Vi = {v ∈ V : f(v) = i} for i = 0, 1, 2. An RDF f = (V0, V1, V2) is called a locating Roman dominating function (or just LRDF) if N(u) ∩ V2 ≠ N(v) ∩ V2 for any pair u, v of distinct vertices of V0. The locating Roman domination number $\gamma _R^L (G)$ is the minimum weight of an LRDF of G. In this paper, we study the locating Roman domination number in trees. We obtain lower and upper bounds for the locating Roman domination number of a tree in terms of its order and the number of leaves and support vertices, and characterize trees achieving equality for the bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 49-62
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bounds on the Locating Roman Domination Number in Trees
Autorzy:
Jafari Rad, Nader
Rahbani, Hadi
Powiązania:
https://bibliotekanauki.pl/articles/31342446.pdf
Data publikacji:
2018-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Roman domination number
locating domination number
locating Roman domination number
tree
Opis:
A Roman dominating function (or just RDF) on a graph $ G = (V, E) $ is a function $ f : V \rightarrow \{ 0, 1, 2 \} $ satisfying the condition that every vertex $u$ for which $ f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v) = 2$. The weight of an RDF $f$ is the value $ f(V (G)) = \Sigma_{ u \in V (G) } f(u) $. An RDF $f$ can be represented as $ f = (V_0, V_1, V_2) $, where $ V_i = \{ v \in V : f(v) = i \} $ for $ i = 0, 1, 2 $. An RDF $ f = (V_0, V_1, V_2) $ is called a locating Roman dominating function (or just LRDF) if $ N(u) \cap V_2 \ne N(v) \cap V_2 $ for any pair $u$, $v$ of distinct vertices of $ V_0 $. The locating Roman domination number $ \gamma_R^L (G) $ is the minimum weight of an LRDF of $G$. In this paper, we study the locating Roman domination number in trees. We obtain lower and upper bounds for the locating Roman domination number of a tree in terms of its order and the number of leaves and support vertices, and characterize trees achieving equality for the bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 49-62
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Colourings of (k - r, k)-trees
Autorzy:
Borowiecki, M.
Patil, H. P.
Powiązania:
https://bibliotekanauki.pl/articles/255361.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
chromatic polynomial
partition number
colouring
tree
Opis:
Trees are generalized to a special kind of higher dimensional complexes known as (j, k)-trees ([L.W. Beineke, R.E. Pippert, On the structure of (m,n)-trees, Proc. 8th S-E Conf. Combinatorics, Graph Theory and Computing, 1977, 75-80]), and which are a natural extension of k-trees for j = k—1. The aim of this paper is to study (k — r, k)-trees ([H.P. Patil, Studies on k-trees and some related topics, PhD Thesis, University of Warsaw, Poland, 1984]), which are a generalization of k-trees (or usual trees when k = 1). We obtain the chromatic polynomial of (k — r, k)-trees and show that any two (k — r, k)-trees of the same order are chromatically equivalent. However, if r ≠ 1 in any (k — r, k)-tree G, then it is shown that there exists another chromatically equivalent graph H, which is not a (k — r, k)-tree. Further, the vertex-partition number and generalized total colourings of (k — r, k)-trees are obtained. We formulate a conjecture about the chromatic index of (k — r, k)-trees, and verify this conjecture in a number of cases. Finally, we obtain a result of [M. Borowiecki, W. Chojnacki, Chromatic index of k-trees, Discuss. Math. 9 (1988), 55-58] as a corollary in which k-trees of Class 2 are characterized.
Źródło:
Opuscula Mathematica; 2017, 37, 4; 491-500
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A partition of the Catalan numbers and enumeration of genealogical trees
Autorzy:
Schimming, Rainer
Powiązania:
https://bibliotekanauki.pl/articles/972004.pdf
Data publikacji:
1996
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
genealogical tree
Catalan number
generating function
Opis:
A special relational structure, called genealogical tree, is introduced; its social interpretation and geometrical realizations are discussed. The numbers $C_{n,k}$ of all abstract genealogical trees with exactly n+1 nodes and k leaves is found by means of enumeration of code words. For each n, the $C_{n,k}$ form a partition of the n-th Catalan numer Cₙ, that means $C_{n,1}+C_{n,2}+ ...+C_{n,n} = Cₙ$.
Źródło:
Discussiones Mathematicae Graph Theory; 1996, 16, 2; 181-195
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Weakly connected domination critical graphs
Autorzy:
Lemańska, M.
Patyk, A.
Powiązania:
https://bibliotekanauki.pl/articles/255051.pdf
Data publikacji:
2008
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
weakly connected domination number
tree
critical graphs
Opis:
A dominating set D ⊂ V(G) is a weakly connected dominating set in G if the subgraph G[D]w = (NG[D], Ew) weakly induced by D is connected, where Ew is the set of all edges with at least one vertex in D. The weakly connected domination number ϒw(G) of a graph G is the minimum cardinality among all weakly connected dominating sets in G. The graph is said to be weakly connected domination critical (ϒw-critical) if for each u, v ∈ V(G) with v not adjacent to u, ϒw(G + vu) < ϒw(G). Further, G is k- ϒw-critical if ϒw(G) = k and for each edge e ∉ E(G), ϒw(G + e) < k. In this paper we consider weakly connected domination critical graphs and give some properties of 3-ϒw,-critical graphs.
Źródło:
Opuscula Mathematica; 2008, 28, 3; 325-330
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Crossing Numbers of Products of Path with Graphs of Order Six
Autorzy:
Klešč, Marián
Petrillová, Jana
Powiązania:
https://bibliotekanauki.pl/articles/30146431.pdf
Data publikacji:
2013-07-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph
drawing
crossing number
Cartesian product
path
tree
Opis:
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path $ P_n $ of length $ n $, the crossing numbers of Cartesian products $ G \square P_n $ for all connected graphs $G$ on five vertices are also known. In this paper, the crossing numbers of Cartesian products $ G \square P_n $ for graphs $ G $ of order six are studied. Let $ H $ denote the unique tree of order six with two vertices of degree three. The main contribution is that the crossing number of the Cartesian product $ H \square P_n $ is $ 2(n − 1) $. In addition, the crossing numbers of $ G \square P_n $ for fourty graphs $G$ on six vertices are collected.
Źródło:
Discussiones Mathematicae Graph Theory; 2013, 33, 3; 571-582
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 25

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