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 35
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ł:
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ł:
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ł:
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ł:
Radio number for some thorn graphs
Autorzy:
Marinescu-Ghemeci, Ruxandra
Powiązania:
https://bibliotekanauki.pl/articles/744574.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
multilevel distance labeling
radio number
caterpillar
diameter
Opis:
For a graph G and any two vertices u and v in G, let d(u,v) denote the distance between u and v and let diam(G) be the diameter of G. A multilevel distance labeling (or radio labeling) for G is a function f that assigns to each vertex of G a positive integer such that for any two distinct vertices u and v, d(u,v) + |f(u) - f(v)| ≥ diam(G) + 1. The largest integer in the range of f is called the span of f and is denoted span(f). The radio number of G, denoted rn(G), is the minimum span of any radio labeling for G. A thorn graph is a graph obtained from a given graph by attaching new terminal vertices to the vertices of the initial graph. In this paper the radio numbers for two classes of thorn graphs are determined: the caterpillar obtained from the path Pₙ by attaching a new terminal vertex to each non-terminal vertex and the thorn star $S_{n,k}$ obtained from the star Sₙ by attaching k new terminal vertices to each terminal vertex of the star.
Źródło:
Discussiones Mathematicae Graph Theory; 2010, 30, 2; 201-222
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of Riverbank Stability Due to Bamboo Vegetation in Walanae River, South Sulawesi, Indonesia
Autorzy:
Pertiwi, Nurlita
Rauf, Bakhrani Abdul
Lullulangi, Mithen
Powiązania:
https://bibliotekanauki.pl/articles/1955563.pdf
Data publikacji:
2021
Wydawca:
Polskie Towarzystwo Inżynierii Ekologicznej
Tematy:
slope
diameter
weight of bamboo
Walanae river
Opis:
Bamboo vegetation is an endemic plant in Indonesia that grows on riverbanks. These plants have the potential to increase shear resistance due to the bond between the roots to the soil. However, an increase in plant weight due to its growth causes additional loads of soil. The condition triggers the release of soil on the slopes and causes riverbank sliding. Therefore, in developing the riparian ecological function, it is necessary to maintain the plants without neglecting the risk of physical damage to the river. This study aimed to estimate the risk of riverbank sliding due to the presence of bamboo plants by utilizing the bamboo vegetation conditions on the Walanae River. It was carried out on the 42.4 km riverbank in the middle area of Walanae watershed. The researchers selected 46 clumps of parring bamboo (Gigantochloa atter) as an endemic bamboo in this area and growing in the riverbank. The diameter of the bamboo trunk is the basis for an estimate of the weight of the bamboo clump. Furthermore, a numerical analysis was carried out by taking into account the load and shear resistance on the slope, including the weight of the plant. The research results indicated that bamboo is feasible to be applied for riverbank protection using the soil bioengineering method. The bamboo weight, which is indicated by the number of poles and diameter, significantly affects the stability of the slope. Therefore, the prevention of rising weight by harvesting method is critical to consider in riverbank protection.
Źródło:
Journal of Ecological Engineering; 2021, 22, 9; 176-184
2299-8993
Pojawia się w:
Journal of Ecological Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Characterization Results for the L(2, 1, 1)-Labeling Problem on Trees
Autorzy:
Zhang, Xiaoling
Deng, Kecai
Powiązania:
https://bibliotekanauki.pl/articles/32031843.pdf
Data publikacji:
2017-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
tree
diameter
L(2, 1, 1)-labeling
Opis:
An L(2, 1, 1)-labeling of a graph G is an assignment of non-negative integers (labels) to the vertices of G such that adjacent vertices receive labels with difference at least 2, and vertices at distance 2 or 3 receive distinct labels. The span of such a labelling is the difference between the maximum and minimum labels used, and the minimum span over all L(2, 1, 1)-labelings of G is called the L(2, 1, 1)-labeling number of G, denoted by λ2,1,1(G). It was shown by King, Ras and Zhou in [The L(h, 1, 1)-labelling problem for trees, European J. Combin. 31 (2010) 1295–1306] that every tree T has Δ2(T) − 1 ≤ λ2,1,1(T) ≤ Δ2(T), where Δ2(T) = maxuv∈E(T)(d(u) + d(v)). And they conjectured that almost all trees have the L(2, 1, 1)-labeling number attain the lower bound. This paper provides some sufficient conditions for λ2,1,1(T) = Δ2(T). Furthermore, we show that the sufficient conditions we provide are also necessary for trees with diameter at most 6.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 3; 611-622
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Various Bounds for Liar’s Domination Number
Autorzy:
Alimadadi, Abdollah
Mojdeh, Doost Ali
Rad, Nader Jafari
Powiązania:
https://bibliotekanauki.pl/articles/31340859.pdf
Data publikacji:
2016-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
liar’s domination
diameter
regular graph
Nordhaus-Gaddum
Opis:
Let $ G = (V,E) $ be a graph. A set $ S \subseteq V $ is a dominating set if \( \bigcup_{v \in S} N[v] = V \), where $ N[v] $ is the closed neighborhood of $ v $. Let $ L \subseteq V $ be a dominating set, and let $v$ be a designated vertex in $V$ (an intruder vertex). Each vertex in $ L \cap N[v] $ can report that $v$ is the location of the intruder, but (at most) one $ x \in L \cap N[v] $ can report any $ w \in N[x] $ as the intruder location or $ x $ can indicate that there is no intruder in $ N[x] $. A dominating set $L$ is called a liar’s dominating set if every $ v \in V (G) $ can be correctly identified as an intruder location under these restrictions. The minimum cardinality of a liar’s dominating set is called the liar’s domination number, and is denoted by $ \gamma_{LR} (G) $. In this paper, we present sharp bounds for the liar’s domination number in terms of the diameter, the girth and clique covering number of a graph. We present two Nordhaus-Gaddum type relations for $ \gamma_{LR} (G) $, and study liar’s dominating set sensitivity versus edge-connectivity. We also present various bounds for the liar’s domination component number, that is, the maximum number of components over all minimum liar’s dominating sets.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 3; 629-641
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Graphs that are Critical for the Packing Chromatic Number
Autorzy:
Brešar, Boštjan
Ferme, Jasmina
Powiązania:
https://bibliotekanauki.pl/articles/32318620.pdf
Data publikacji:
2022-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
packing coloring
critical graph
diameter
block graph
tree
Opis:
Given a graph G, a coloring c : V (G) → {1, …, k} such that c(u) = c(v) = i implies that vertices u and v are at distance greater than i, is called a packing coloring of G. The minimum number of colors in a packing coloring of G is called the packing chromatic number of G, and is denoted by χρ(G). In this paper, we propose the study of χρ-critical graphs, which are the graphs G such that for any proper subgraph H of G, χρ(H) < χρ(G). We characterize χρ-critical graphs with diameter 2, and χρ-critical block graphs with diameter 3. Furthermore, we characterize χρ-critical graphs with small packing chromatic number, and we also consider χρ-critical trees. In addition, we prove that for any graph G and every edge e ∈ E(G), we have (χρ(G)+1)/2 ≤ χρ(G−e) ≤ χρ(G), and provide a corresponding realization result, which shows that χρ(G − e) can achieve any of the integers between these bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 2; 569-589
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 35

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