Results 151 to 160 of about 59,293 (196)
Plant Biotechnology Journal, Volume 24, Issue 5, Page 2917-2938, May 2026.Schematic summary of the machine learning‐driven analysis for high‐yield cucumber architecture. This study employs machine learning methods to analyze key shoot and root traits, building a predictive model for yield. The analysis identifies an optimal plant architecture: a compact and sturdy shoot structure, combined with a narrow yet larger‐diameter ...
Cuifang Zhu +8 more
wiley +1 more source
Journal of Combinatorial Theory Series B, 2005 Graphs of high girth have been much studied, especially in the context of the minimum vertex number of graphs of given girth and minimum degree. The authors study the treewidth \(\text{tw}(G)\) of a graph \(G\), giving a lower bound in terms of the girth \(g(G)\) and average degree \(d(G)\). They show that \[ \text{tw}(G)\geq c {1\over g(G)+1} (d(G)-1)^
Chandran, L., Subramanian, C.
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Girth and Euclidean distortion
Geometric And Functional Analysis, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nathan Linial, Avner Magen, Assaf Naor
openaire +1 more source
AJN, American Journal of Nursing, 2012
Addressing obesity requires more than self-control.
openaire +2 more sources
Addressing obesity requires more than self-control.
openaire +2 more sources
Journal of Graph Theory, 2002
AbstractFor each fixed k ≥ 0, we give an upper bound for the girth of a graph of order n and size n + k. This bound is likely to be essentially best possible as n → ∞. © 2002 Wiley Periodicals, Inc.
Béla Bollobás, Endre Szemerédi
openaire +2 more sources
AbstractFor each fixed k ≥ 0, we give an upper bound for the girth of a graph of order n and size n + k. This bound is likely to be essentially best possible as n → ∞. © 2002 Wiley Periodicals, Inc.
Béla Bollobás, Endre Szemerédi
openaire +2 more sources
Journal of Graph Theory, 1989
AbstractLet G be 2‐connected graph with girth g and minimum degree d. Then each pair of vertices of G is joined by a path of length at least max{1/2(d − 1)g, (d − 3/2)(g − 4) + 2} if g ⩾ 4, and the length of a longest cycle of G is at least max{[(d − 1)(g − 2) + 2], [(2d − 3)(g − 4) + 4]}.
openaire +2 more sources
AbstractLet G be 2‐connected graph with girth g and minimum degree d. Then each pair of vertices of G is joined by a path of length at least max{1/2(d − 1)g, (d − 3/2)(g − 4) + 2} if g ⩾ 4, and the length of a longest cycle of G is at least max{[(d − 1)(g − 2) + 2], [(2d − 3)(g − 4) + 4]}.
openaire +2 more sources
Canadian Mathematical Bulletin, 1982
AbstractLower bounds are given for the independence ratio in graphs satisfying certain girth and maximum degree requirements. In particular, the independence ratio of a graph with maximum degree Δ and girth at least six is at least (2Δ − 1)/(Δ2 + 2Δ − 1). Sharper bounds are given for cubic graphs.
Hopkins, Glenn, Staton, William
openaire +2 more sources
AbstractLower bounds are given for the independence ratio in graphs satisfying certain girth and maximum degree requirements. In particular, the independence ratio of a graph with maximum degree Δ and girth at least six is at least (2Δ − 1)/(Δ2 + 2Δ − 1). Sharper bounds are given for cubic graphs.
Hopkins, Glenn, Staton, William
openaire +2 more sources
Comparison of girth materials, girth tensions and their effects on performance in racehorses
Australian Veterinary Journal, 2005ObjectiveTo compare the effect of girth materials and commonly used girth tensions on athletic performance of racehorses and to test the length tension properties of commercially available girths.ProcedureSeven horses were exercised at speeds to produce 95% of maximal heart rates on 15 occasions using a randomised block design, and girthed with 5 ...
J, Bowers, R F, Slocombe
openaire +2 more sources
A note on the girth of digraphs
Combinatorica, 1982Behzad, Chartrand and Wall conjectured that the girth of a diregular graph of ordern and outdegreer is not greater than [n /r]. This conjecture has been proved forr=2 by Behzad and forr=3 by Bermond. We prove that a digraph of ordern and halfdegree ≧4 has girth not exceeding [n / 4]. We also obtain short proofs of the above results.
openaire +2 more sources
Girth and Total Domination in Graphs
Graphs and Combinatorics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning, Anders Yeo
openaire +2 more sources