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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 20
Tytuł:
Anthropometric and motor performance characteristics of male soccer players in public universities
Autorzy:
Mensah, Timothy K.
Moses, Monday O.
Domfeh, Charles
Powiązania:
https://bibliotekanauki.pl/articles/1030951.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Szczeciński. Wydawnictwo Naukowe Uniwersytetu Szczecińskiego
Tematy:
arm length and girth
chest girth
finger span
kicking abilities
muscular strength
Opis:
Background: Training of athletes for optimal performance would be enhanced in an environment of appropriate data. There is, however, limited data on anthropometric and sport performance characteristics of male soccer players in Ghanaian public universities. This study comparatively presents the distribution of anthropometric and motor performance characteristics of male soccer players among public universities. Methods: Male soccer players (n = 44, mean age = 22.61 ±1.87 yrs) from four public universities were recruited. Weight, leg length, thigh girth, calf girth, forearm length, upper arm length, upper arm girth, chest girth, and finger span were measured. The participants were also assessed on a 36.58 m (40 yards) dash, vertical jump, agility, flexibility, sit-ups, push-ups, dribbling, shooting accuracy, and kicking distance. Results: There were significant differences in the forearm length (p = 0.001), leg power (p = 0.040), abdominal strength (p = 0.005), agility (p = 0.001), flexibility (p = 0.009), and upper body strength (p = 0.023) among the male soccer players of the universities. All anthropometric characteristics significantly predicted kicking distance (p = 0.002). Thigh girth (p = 0.014), chest girth (p = 0.010) and finger span (p = 0.012) significantly distinctly served as predictors. Conclusion: Anthropometric and motor performance characteristics were relatively different among male soccer players in Ghana public universities. University soccer coaches should place major emphasis on individual traits and potentials when developing combined training regimes.
Źródło:
Central European Journal of Sport Sciences and Medicine; 2020, 32, 4; 15-25
2300-9705
2353-2807
Pojawia się w:
Central European Journal of Sport Sciences and Medicine
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimal regular graphs with given girths and crossing numbers
Autorzy:
Chia, G.
Gan, C.
Powiązania:
https://bibliotekanauki.pl/articles/744483.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
regular graphs
girth
crossing numbers
Opis:
This paper investigates on those smallest regular graphs with given girths and having small crossing numbers.
Źródło:
Discussiones Mathematicae Graph Theory; 2004, 24, 2; 223-237
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Light Graphs In Planar Graphs Of Large Girth
Autorzy:
Hudák, Peter
Maceková, Mária
Madaras, Tomáš
Široczki, Pavol
Powiązania:
https://bibliotekanauki.pl/articles/31341096.pdf
Data publikacji:
2016-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
planar graph
girth
light graph
Opis:
A graph \( H \) is defined to be light in a graph family if there exist finite numbers \( \phi (H, \mathcal{G} ) \) and \( w(H,\mathcal{G} ) \) such that each \( G \in \mathcal{G} \) which contains \( H \) as a subgraph, also contains its isomorphic copy \( K \) with \( \Delta_G (K) \le \phi (H, \mathcal{G} ) \) and \( \Sigma_{ x \in V(K) } \text{ deg}_G (x) \le w(H, \mathcal{G}) \). In this paper, we investigate light graphs in families of plane graphs of minimum degree 2 with prescribed girth and no adjacent 2-vertices, specifying several necessary conditions for their lightness and providing sharp bounds on \( \phi \) and w for light \( K_{1,3} \) and \( C_{10} \).
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 1; 227-238
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Short Proof for a Lower Bound on the Zero Forcing Number
Autorzy:
Fürst, Maximilian
Rautenbach, Dieter
Powiązania:
https://bibliotekanauki.pl/articles/32083733.pdf
Data publikacji:
2020-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
zero forcing
girth
Moore bound
Opis:
We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number Z(G) of a graph G. More specifically, we show that Z(G) ≥ (g − 2)(δ − 2) + 2 for every graph G of girth g at least 3 and minimum degree δ at least 2.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 1; 355-360
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on total colorings of planar graphs without 4-cycles
Autorzy:
Wang, Ping
Wu, Jian-Liang
Powiązania:
https://bibliotekanauki.pl/articles/744436.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
total coloring
planar graph
list coloring
girth
Opis:
Let G be a 2-connected planar graph with maximum degree Δ such that G has no cycle of length from 4 to k, where k ≥ 4. Then the total chromatic number of G is Δ +1 if (Δ,k) ∈ {(7,4),(6,5),(5,7),(4,14)}.
Źródło:
Discussiones Mathematicae Graph Theory; 2004, 24, 1; 125-135
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Spectra of Orders for k-Regular Graphs of Girth g
Autorzy:
Jajcay, Robert
Raiman, Tom
Powiązania:
https://bibliotekanauki.pl/articles/32222719.pdf
Data publikacji:
2021-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
cage
k -regular graph
girth
Sauer bound
Opis:
A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs of infinitely many orders are known to exist. Our goal, for given k and g, is the classification of all orders n for which a (k, g)-graph of order n exists; we choose to call the set of all such orders the spectrum of orders of (k, g)-graphs. The smallest of these orders (the first element in the spectrum) is the order of a (k, g)-cage; the (k, g)-graph of the smallest possible order. The exact value of this order is unknown for the majority of parameters (k, g). We determine the spectra of orders for (2, g), g ≥ 3, (k, 3), k ≥ 2, and (3, 5)-graphs, as well as the spectra of orders of some families of (k, 4)-graphs. In addition, we present methods for obtaining (k, g)-graphs that are larger then the smallest known (k, g)-graphs, but are smaller than (k, g)-graphs obtained by Sauer. Our constructions start from (k, g)-graphs that satisfy specific conditions derived in this paper and result in graphs of orders larger than the original graphs by one or two vertices. We present theorems describing ways to obtain ‘starter graphs’ whose orders fall in the gap between the well-known Moore bound and the constructive bound derived by Sauer and are the first members of an infinite sequence of graphs whose orders cover all admissible orders larger than those of the ‘starter graphs’.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 4; 1115-1125
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
Autorzy:
Fan, Yi-Zheng
Tan, Ying-Ying
Peng, Xi-Xi
Liu, An-Hong
Powiązania:
https://bibliotekanauki.pl/articles/31340758.pdf
Data publikacji:
2016-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
tensor
spectral radius
unicyclic hypergraph
bicyclic hypergraph
girth
Opis:
In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs, linear or power unicyclic hypergraphs with given girth, linear or power bicyclic hypergraphs, respectively.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 4; 845-856
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Some Properties of Antipodal Partial Cubes
Autorzy:
Polat, Norbert
Powiązania:
https://bibliotekanauki.pl/articles/31512721.pdf
Data publikacji:
2020-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
antipodal graph
partial cube
interval monotony
girth
diameter
Opis:
We prove that an antipodal bipartite graph is a partial cube if and only it is interval monotone. Several characterizations of the principal cycles of an antipodal partial cube are given. We also prove that an antipodal partial cube G is a prism over an even cycle if and only if its order is equal to 4(diam(G) − 1), and that the girth of an antipodal partial cube is less than its diameter whenever it is not a cycle and its diameter is at least equal to 6.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 3; 755-770
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decompositions of a complete multidigraph into almost arbitrary paths
Autorzy:
Meszka, Mariusz
Skupień, Zdzisław
Powiązania:
https://bibliotekanauki.pl/articles/743246.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
complete digraph
multidigraph
tour girth
arbitrary path decomposition
Opis:
For n ≥ 4, the complete n-vertex multidigraph with arc multiplicity λ is proved to have a decomposition into directed paths of arbitrarily prescribed lengths ≤ n - 1 and different from n - 2, unless n = 5, λ = 1, and all lengths are to be n - 1 = 4. For λ = 1, a more general decomposition exists; namely, up to five paths of length n - 2 can also be prescribed.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 2; 357-372
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On well-covered graphs of odd girth 7 or greater
Autorzy:
Randerath, Bert
Vestergaard, Preben
Powiązania:
https://bibliotekanauki.pl/articles/743557.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
well-covered
independence number
domination number
odd girth
Opis:
A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer [14] defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. One of the most challenging problems in this area, posed in the survey of Plummer [15], is to find a good characterization of well-covered graphs of girth 4. We examine several subclasses of well-covered graphs of girth ≥ 4 with respect to the odd girth of the graph. We prove that every isolate-vertex-free well-covered graph G containing neither C₃, C₅ nor C₇ as a subgraph is even very well-covered. Here, a isolate-vertex-free well-covered graph G is called very well-covered, if G satisfies α(G) = n/2. A vertex set D of G is dominating if every vertex not in D is adjacent to some vertex in D. The domination number γ(G) is the minimum order of a dominating set of G. Obviously, the inequality γ(G) ≤ α(G) holds. The family $_{γ=α}$ of graphs G with γ(G) = α(G) forms a subclass of well-covered graphs. We prove that every connected member G of $_{γ=α}$ containing neither C₃ nor C₅ as a subgraph is a K₁, C₄,C₇ or a corona graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2002, 22, 1; 159-172
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some applications of pq-groups in graph theory
Autorzy:
Exoo, Geoffrey
Powiązania:
https://bibliotekanauki.pl/articles/744429.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Ramsey number
edge coloring
cage
degree
girth
Cayley graph
Opis:
We describe some new applications of nonabelian pq-groups to construction problems in Graph Theory. The constructions include the smallest known trivalent graph of girth 17, the smallest known regular graphs of girth five for several degrees, along with four edge colorings of complete graphs that improve lower bounds on classical Ramsey numbers.
Źródło:
Discussiones Mathematicae Graph Theory; 2004, 24, 1; 109-114
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An ideal-based zero-divisor graph of direct products of commutative rings
Autorzy:
Atani, S.
Kohan, M.
Sarvandi, Z.
Powiązania:
https://bibliotekanauki.pl/articles/729207.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
zero-divisor graph
ideal-based
diameter
girth
finite direct product
Opis:
In this paper, specifically, we look at the preservation of the diameter and girth of the zero-divisor graph with respect to an ideal of a commutative ring when extending to a finite direct product of commutative rings.
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2014, 34, 1; 45-53
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
Autorzy:
Axenovich, Maria
Karrer, Annette
Powiązania:
https://bibliotekanauki.pl/articles/32361723.pdf
Data publikacji:
2022-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
hypergraph
chromatic number
mixed hypergraph
bihyper-graphs
monochromatic
rainbow
girth
selective
Opis:
A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k. This implies that there are sparse hypergraphs such that in any coloring of their vertices with at most k − 1 colors there is a monochromatic hyperedge. When there is no restriction on the number of the colors used, one can easily avoid monochromatic hyperedges. Then, however, so-called rainbow or multicolored hyperedges might appear. Nešetřil and Rödl [19] called hypergraphs such that in any vertex-coloring there is either a monochromatic or a rainbow hyperedge, selective. They showed an existence of selective r-uniform hypergraphs of girth g for any integers r, g ≥ 2 using probabilistic and explicit constructions. In this paper, we provide a slightly di erent construction of such hypergraphs and summarize the probabilistic approaches. The main building block of the construction, a part-rainbow-forced hypergraph, is of independent interest. This is an r-uniform r-partite hypergraph with a given girth such that in any vertex-coloring that is rainbow on each part, there is a rainbow hyperedge. We give a simple construction of such a hypergraph that does not use iterative amalgamation.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 2; 471-484
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Detour chromatic numbers
Autorzy:
Frick, Marietjie
Bullock, Frank
Powiązania:
https://bibliotekanauki.pl/articles/743511.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
detour
generalised chromatic number
longest path
vertex partition
girth
circumference
nearly bipartite
Opis:
The nth detour chromatic number, χₙ(G) of a graph G is the minimum number of colours required to colour the vertices of G such that no path with more than n vertices is monocoloured. The number of vertices in a longest path of G is denoted by τ( G). We conjecture that χₙ(G) ≤ ⎡(τ(G))/n⎤ for every graph G and every n ≥ 1 and we prove results that support the conjecture. We also present some sufficient conditions for a graph to have nth chromatic number at most 2.
Źródło:
Discussiones Mathematicae Graph Theory; 2001, 21, 2; 283-291
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Determination of a System of Women’s Clothing Sizes in the Goransko-primorska County of the Republic of Croatia
Opracowanie systemu wymiarowania odzieży kobiecej w jednym z regionów Chorwacji
Autorzy:
Doležal, K.
Hrženjak, R.
Ujević, D.
Powiązania:
https://bibliotekanauki.pl/articles/232309.pdf
Data publikacji:
2016
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Biopolimerów i Włókien Chemicznych
Tematy:
garment sizes
bust girth
body height
rozmiary odzieży
obwód biustu
wysokość ciała
Opis:
The aim of this work is to improve the system of clothing sizes by the determining body measurements of adult women in the Goransko-primorska County of the Republic of Croatia. The system of clothing sizes was determined based on the results of anthropometric investigations of a specific population. Sorting data on body measurements results in their grouping in garment sizes, and based on this data, size-charts with significant differences in body shape and body proportions of a certain group of the population are created. In the system of garment sizes certain body dimensions define a garment size and create a scale determined by the standard. The standard characterizes body shape based on two dimensions of measurements, whereby the first is the basic (bust girth), and the second - a dependent variable (body height). This study was conducted on a sample of 1,104 subjects aged 20-85 years classified into seven age groups. Statistical analysis of the results, i.e. principal component analysis, was used to determine garment sizes and the presence of certain categories of them in the population measured in the Goransko-primorska County of the Republic of Croatia.
Celem pracy było polepszenie systemu wymiarowania odzieży poprzez przeprowadzenie pomiarów antropometrycznych dorosłych kobiet. Wyselekcjonowano wybrane populacje, których wymiary pozwoliły na wyróżnienie grup różniących się znacznie między sobą kształtem ciała i jego proporcjami. Wymiary określonych części ciała determinują przynależność do danej grupy, określono standardowe wymiary dla poszczególnych grup. Jako podstawę przyjęto obwód klatki piersiowej oraz wysokość. Pomiary przeprowadzono dla 1104 osób w wieku 20-85 lat sklasyfikowanych w siedem grup wiekowych. Badania zostały udokumentowane analizą statystyczną.
Źródło:
Fibres & Textiles in Eastern Europe; 2016, 6 (120); 26-31
1230-3666
2300-7354
Pojawia się w:
Fibres & Textiles in Eastern Europe
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 20

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