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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 223
Tytuł:
The Proper Diameter of a Graph
Autorzy:
Coll, Vincent
Hook, Jonelle
Magnant, Colton
McCready, Karen
Ryan, Kathleen
Powiązania:
https://bibliotekanauki.pl/articles/32062335.pdf
Data publikacji:
2020-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
diameter
properly connected
proper diameter
Opis:
A proper edge-coloring of a graph is a coloring in which adjacent edges receive distinct colors. A path is properly colored if consecutive edges have distinct colors, and an edge-colored graph is properly connected if there exists a properly colored path between every pair of vertices. In such a graph, we introduce the notion of the graph’s proper diameter—which is a function of both the graph and the coloring—and define it to be the maximum length of a shortest properly colored path between any two vertices in the graph. We consider various families of graphs to find bounds on the gap between the diameter and possible proper diameters, paying singular attention to 2-colorings.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 1; 107-125
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Degree-Diameter Problem for Outerplanar Graphs
Autorzy:
Dankelmann, Peter
Jonck, Elizabeth
Vetrík, Tomáš
Powiązania:
https://bibliotekanauki.pl/articles/31341627.pdf
Data publikacji:
2017-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
outerplanar
diameter
degree
degree-diameter problem
distance
separator theorem
Opis:
For positive integers $ \Delta $ and $ D $ we define $ n_{ \Delta, D } $ to be the largest number of vertices in an outerplanar graph of given maximum degree $ \Delta $ and diameter $D$. We prove that $n_{ \Delta , D} = \Delta^{D/2} + O ( \Delta^{ D/2 -1 } ) $ if $D$ is even, and $ n_{ \Delta, D} = 3 \Delta^\frac{D−1}{2} + O (\Delta^{ \frac{D−1}{2}−1 } ) $ if $D$ is odd. We then extend our result to maximal outerplanar graphs by showing that the maximum number of vertices in a maximal outerplanar graph of maximum degree $ \Delta $ and diameter $D$ asymptotically equals$ n_{ \Delta , D }.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 3; 823-834
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Assessment of the effect of size of the umbilical ring on the risk of umbilical hernia complication in children
Autorzy:
Emeka, Chukwubuike Kevin
Chikaodili, Eze Thaddeus
Powiązania:
https://bibliotekanauki.pl/articles/2049116.pdf
Data publikacji:
2022-03-30
Wydawca:
Uniwersytet Rzeszowski. Wydawnictwo Uniwersytetu Rzeszowskiego
Tematy:
complications
diameter
risk
Opis:
Introduction and aim. Assessment of risk of complications in umbilical hernia is important. The aim of this study was to evaluate the effect of size of the umbilical ring on the risk of complication occurring in umbilical hernia. Material and methods. This was a prospective study of children who had umbilical hernia repair for symptomatic umbilical hernia. Using Vernier caliper, the umbilical ring diameter (URD) was measured at surgery and the patients were divided into 2 groups. Group A had URD of less than of 15 millimeter (mm) and group B patients had URD of 15 mm and above. The 2 groups were compared. Results. Thirty two cases were evaluated. Their mean age was 42 months. All the patients had umbilical pain. Twenty six (81.3%) patients had URD of less than 15 mm (group A) whereas 6 (18.7%) patients had URD of greater or equal to 15 mm (group B). Group A patients had a mean URD of 12.1±3.4 mm whereas group B patients had a mean URD of 30.5±5.0 mm (p=0.001). Conclusion. Children who have URD of less than 15 mm are at a higher risk of developing umbilical hernia complications.
Źródło:
European Journal of Clinical and Experimental Medicine; 2022, 1; 75-79
2544-2406
2544-1361
Pojawia się w:
European Journal of Clinical and Experimental Medicine
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The dynamics of the Taxus baccata L. population and the factors affecting its regeneration in the Jasień Nature Reserve
Autorzy:
Bujoczek, L.
Bujoczek, M.
Powiązania:
https://bibliotekanauki.pl/articles/2078292.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Instytut Dendrologii PAN
Tematy:
English yew
seedlings
saplings
diameter increment
diameter distribution
mortality
Opis:
Taxus baccata L. is a relict plant and has a scattered distribution in the entire species range. Yew regeneration may be affected by moisture conditions and tree stand characteristics – variables which change over time and which have not been sufficiently researched to date. The present study determined the size structure of yews, causes of yew mortality, the effects of tree stand characteristics and habitat conditions on yew diameter increment at breast height, the density of yew seedlings and saplings, and the likelihood of yew seedling occurrence. The study was conducted in central Poland, on 22 permanent sampling plots. The paper presents data col- lected in 2017 with reference to previous studies on these plots from 2001 and 2007. Stand volume, basal area, number of trees, canopy cover, and type of forest site were established for the tree layer. Saplings and shrubs were counted. Finally, the parameters determined for yew seedlings included density and percentage of individuals damaged by browsing, as well as soil moisture and percentage cover of herbaceous vegetation in the nearest neighborhood. In 2017, yew density in the tree layer was 70 individuals/ha, having increased by 15 individuals/ha over 16 years. During that period, 6.4 individuals/ha died in that layer. The predominant cause of yew mortality was wind. In the period 2007–2017, the mean diameter increment at breast height was 2.2 mm/year, and indicated a weak relationship only with tree diameter at the beginning of the studied period (R2 = 0.06). In 2017, the mean density of yew saplings and seedlings was 55 individuals/ha and 1005 individuals/ha, re- spectively. Two independent variables were found to be significant in the model of yew seedling occurrence: presence of mature yews on the sampling plot and soil moisture. The condition of the studied yew population is satisfactory, especially in the less moist areas. The number of seedlings is acceptable, but more active protection should be considered due to the scarcity of yew sap- lings. This is all the more important as seed-producing mature yews tend to die as a result of exposure to strong winds and periodic local flooding.
Źródło:
Dendrobiology; 2018, 80; 24-36
1641-1307
Pojawia się w:
Dendrobiology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimum Edge Cuts in Diameter 2 Graphs
Autorzy:
Bickle, Allan
Schwenk, Allen
Powiązania:
https://bibliotekanauki.pl/articles/31343375.pdf
Data publikacji:
2019-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge connectivity
diameter
Opis:
Plesnik proved that the edge connectivity and minimum degree are equal for diameter 2 graphs. We provide a streamlined proof of this fact and characterize the diameter 2 graphs with a nontrivial minimum edge cut.
Źródło:
Discussiones Mathematicae Graph Theory; 2019, 39, 2; 605-608
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Further results on radial graphs
Autorzy:
Kathiresan, Kumarappan
Marimuthu, G.
Powiązania:
https://bibliotekanauki.pl/articles/744513.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
radius
diameter
radial graph
Opis:
In a graph G, the distance d(u,v) between a pair of vertices u and v is the length of a shortest path joining them. The eccentricity e(u) of a vertex u is the distance to a vertex farthest from u. The minimum eccentricity is called the radius of the graph and the maximum eccentricity is called the diameter of the graph. The radial graph R(G) based on G has the vertex set as in G, two vertices u and v are adjacent in R(G) if the distance between them in G is equal to the radius of G. If G is disconnected, then two vertices are adjacent in R(G) if they belong to different components. The main objective of this paper is to characterize graphs G with specified radius for its radial graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2010, 30, 1; 75-83
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Study on bubble characteristics of flotation column in hematite reverse cationic flotation process
Autorzy:
Wang, Weizhi
Han, Jikang
Powiązania:
https://bibliotekanauki.pl/articles/1450070.pdf
Data publikacji:
2020
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
column flotation
bubble generator
GE-609
circularity
bubble diameter
bubble Sauter diameter
Opis:
In the self-designed flotation column simulation system, the foaming characteristics of the micro-bubble countercurrent contact flotation column used in the hematite cation column flotation process are systematically studied. The objective of this study is to investigate the bubble generation by a bubble generator in the flotation column. The bubble image was obtained by the high-speed camera recorder, and the bubble diameter was calculated and analyzed by image processing software. The distribution characteristics of the bubble size under different aeration conditions and with different reagent concentrations were investigated. The results show that as the aeration increases, the average diameter bubbles increases, the bubble size distribution changes from narrow to wide, and the number of small bubbles decreases. The cationic collector GE-609 can change the bubble shape. As the concentration increases, the bubble shape gradually changes from an irregular shape to a standard spherical shape. When the concentration of GE-609 exceeds 2.5 mg/dm3, the average circularity C of the bubbles in the bubble group stabilizes at 1, and the increase in concentration no longer changes the bubble shape. GE-609 also has an efficient foaming effect, as the concentration increases, the bubble diameter distribution changes significantly, the proportion of small bubbles increases, and the proportion of large bubbles decreases significantly. When the critical concentration is exceeded, the bubble diameter distribution probability density peak width no longer changes significantly. Compared with the two types of alcohol foaming agents, GE-609 produces a bubble Sauter diameter close to that of 2-octanol and slightly lower than terpineol.
Źródło:
Physicochemical Problems of Mineral Processing; 2020, 56, 1; 64-75
1643-1049
2084-4735
Pojawia się w:
Physicochemical Problems of Mineral Processing
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Minimum Harmonic Index for Unicyclic Graphs with Given Diameter
Autorzy:
Zhong, Lingping
Powiązania:
https://bibliotekanauki.pl/articles/31342329.pdf
Data publikacji:
2018-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
harmonic index
unicyclic graphs
diameter
Opis:
The harmonic index of a graph $G$ is defined as the sum of the weights \( \tfrac{2}{d(u)+d(v)} \) of all edges uv of G, where $d(u)$ denotes the degree of a vertex $u$ in $G$. In this paper, we present the minimum harmonic index for unicyclic graphs with given diameter and characterize the corresponding extremal graphs. This answers an unsolved problem of Zhu and Chang [26].
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 2; 429-442
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Characterization of super-radial graphs
Autorzy:
Kathiresan, K.M.
Marimuthu, G.
Parameswaran, C.
Powiązania:
https://bibliotekanauki.pl/articles/30148721.pdf
Data publikacji:
2014-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
radius
diameter
super-radial graph
Opis:
In a graph G, the distance d(u, v) between a pair of vertices u and v is the length of a shortest path joining them. The eccentricity e(u) of a vertex u is the distance to a vertex farthest from u. The minimum eccentricity is called the radius, r(G), of the graph and the maximum eccentricity is called the diameter, d(G), of the graph. The super-radial graph R*(G) based on G has the vertex set as in G and two vertices u and v are adjacent in R*(G) if the distance between them in G is greater than or equal to d(G) − r(G) + 1 in G. If G is disconnected, then two vertices are adjacent in R*(G) if they belong to different components. A graph G is said to be a super-radial graph if it is a super-radial graph R*(H) of some graph H. The main objective of this paper is to solve the graph equation R*(H) = G for a given graph G.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 4; 829-848
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Changes in pasta properties during cooking and short-time storage
Autorzy:
Biernacka, B.
Dziki, D.
Miś, A.
Rudy, S.
Krzykowski, A.
Polak, R.
Różyło, R.
Powiązania:
https://bibliotekanauki.pl/articles/2082561.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Instytut Agrofizyki PAN
Tematy:
pasta
diameter
texture
cooking
storage
Opis:
The fundamental aim of this research was to study changes in the physical properties of spaghetti during cooking and after the first hour of storage. In addition, the research evaluated the cooking properties of pasta. For testing purposes, eight samples of spaghetti, produced using semolina and common wheat flour, were used. After cooking, the samples of spaghetti were stored for 2, 5, 10, 20, 30, 40, 50 and 60 min. After storage, the samples of cooked spaghetti were cut, and both the cutting force (hardness) and the cutting energy (firmness) of the samples were determined. It was found that, after storage, the cutting force and energy of cooked pasta decreased, in average terms, from 1.0 to 0.44 N and from 0.84 to 0.43 mJ, respectively. The statistical analysis showed a significant correlation between the storage time and the textural parameters of pasta. The hardness and firmness of pasta, which was al dente after cooking, were found to decrease about twice during storage, as a result of water migration. The hardness of pasta stabilised after 50 min of the storage of cooked spaghetti. Moreover, the obtained data revealed that the diameter increase index of spaghetti could indicate the quality of pasta.
Źródło:
International Agrophysics; 2019, 33, 3; 323-330
0236-8722
Pojawia się w:
International Agrophysics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the diameter of dot-critical graphs
Autorzy:
Mojdeh, D. A.
Mirzamani, S.
Powiązania:
https://bibliotekanauki.pl/articles/255186.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
dot-critical graph
domination
diameter
Opis:
A graph G is k-dot-critical (totally k-dot-critical) if G is dot-critical (totally dot-critical) and the domination number is k. In the paper [T. Burtona, D. P. Sumner, Domination dot-critical graphs, Discrete Math, 306(2006), 11-18] the following question is posed: What are the best bounds for the diameter of a k-dot-critical graph and a totally k-dot-critical graph G with no critical vertices for k ≥ 4? We find the best bound for the diameter of a k-dot-critical graph, where k ∈ {4, 5, 6} and we give a family of k-dot-critical graphs (with no critical vertices) with sharp diameter 2k - 3 for even k ≥ 4.
Źródło:
Opuscula Mathematica; 2009, 29, 2; 165-175
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Prognostic Crown Diameter equations for a Mixed Species Plantation in Southern Nigeria
Autorzy:
Buochuama, A.
Oyebade, B. A.
Powiązania:
https://bibliotekanauki.pl/articles/1113007.pdf
Data publikacji:
2018
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
crown
crown diameter
mixed species plantation
model
Opis:
The dimension of a tree crown has an apparent effect on and is strongly linked with the growth of the tree and its diverse parts. Crown information is an important part of numerous growth and yield models. Hence, empirical predictive equations for crown diameter of a mixed species plantation in Southern Nigeria were developed and evaluated in this study. In studying this phenomenon, total enumeration of the selected species in the mixed species plantation was carried out. Moreover, major growth attributes of 185 trees of six species, namely; Khaya ivorensis, Entandrophragma angolense, Terminalia ivorensis, Tectona grandis, Treculia africana and Mansonia altissima were measured and estimated using mensurational methods. Descriptive, correlation, regression and residual analyses were then applied to the quantitative data obtained from the mixed species plantation. For all the species, the best adjudged model with the best fit indices was Ln(cd) = Ln(b0) + b1·CPA·dbh, R2 = 0.936, SEE = 0.037; an indication of parsimonious potential of a predictive exponential model. This paper, therefore, revealed the possibilities of predicting crown diameter for a mixed species plantation in Nigeria with ample prospects for sustainable planning and management decisions that are relevant for any mixed species plantation.
Źródło:
World News of Natural Sciences; 2018, 16; 117-129
2543-5426
Pojawia się w:
World News of Natural Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Smallest Regular Graphs of Given Degree and Diameter
Autorzy:
Knor, Martin
Powiązania:
https://bibliotekanauki.pl/articles/30147224.pdf
Data publikacji:
2014-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
regular graph
degree/diameter problem
extremal graph
Opis:
In this note we present a sharp lower bound on the number of vertices in a regular graph of given degree and diameter.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 1; 187-191
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A reduction of the Graph Reconstruction Conjecture
Autorzy:
Monikandan, S.
Balakumar, J.
Powiązania:
https://bibliotekanauki.pl/articles/30148259.pdf
Data publikacji:
2014-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
reconstruction
diameter
geodetic graph
interval-regular graph
Opis:
A graph is said to be reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all non-geodetic and non-interval-regular blocks G with diam(G) = 2 or diam(G) = diam(Ḡ) = 3 are reconstructible.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 3; 529-537
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Armendariz Graph of a Ring
Autorzy:
Abdioğlu, Cihat
Çelikel, Ece Yetkin
Das, Angsuman
Powiązania:
https://bibliotekanauki.pl/articles/52678678.pdf
Data publikacji:
2018-12-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Armendariz property
diameter
girth
zero-divisor graph
Opis:
In this paper we initiate the study of Armendariz graph of a commutative ring $R$ and investigate the basic properties of this graph such as diameter, girth, domination number, etc. The Armendariz graph of a ring $R$, denoted by $A(R)$, is an undirected graph with nonzero zero-divisors of $R[x]$ (i.e., $Z(R[x])^{\ast}$) as the vertex set, and two distinct vertices \(f(x)=∑_{i=0}^na_ix^i\) and \(g(x)=∑_{j=0}^mb_jx^j\) are adjacent if and only if $a_ib_j = 0$, for all $i$, $j$. It is shown that $A(R)$, a subgraph of $Γ(R[x])$, the zero divisor graph of the polynomial ring $R[x]$, have many graph properties in common with $Γ(R[x])$.
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2018, 38, 2; 189-196
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 223

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