Results 191 to 200 of about 57,717 (241)
Some of the next articles are maybe not open access.
Automated calculation of heart girth measurement in pigs using body surface point clouds
Computers and Electronics in Agriculture, 2019As increasing number of studies for body measurement purposes in both the animal breeding and production stages, several papers have already evaluated the feasibility of consumer depth sensors for linear body measurement of livestock including pigs and ...
Dehai Zhu, Hao Guo
exaly +2 more sources
, 2020
The girth-weld joint of a pipeline can be divided into three parts: base metal, heat affected zone, and weld metal. This study investigates the local mechanical properties of X80 and Q235 girth-welded joints.
Xu Wu +4 more
semanticscholar +1 more source
The girth-weld joint of a pipeline can be divided into three parts: base metal, heat affected zone, and weld metal. This study investigates the local mechanical properties of X80 and Q235 girth-welded joints.
Xu Wu +4 more
semanticscholar +1 more source
Topological Minors in Graphs of Large Girth [PDF]
We prove that every graph of minimum degree at least r and girth at least 186 contains a subdivision of Kr+1 and that for r⩾435 a girth of at least 15 suffices.
Daniela Kuhn, Deryk Osthus
exaly +2 more sources
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
Constructions of Type-II QC-LDPC Codes With Girth Eight from Sidon Sequence
IEEE Transactions on Communications, 2019In this paper, we consider the constructions of type-II quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight from a Sidon sequence.
Guohua Zhang +3 more
semanticscholar +1 more source
Collisional vibration of PIGs (pipeline inspection gauges) passing through girth welds in pipelines
Journal of Natural Gas Science and Engineering, 2017Shimin Zhang, Shuhai Liu
exaly +2 more sources
European journal of combinatorics (Print), 2018
We consider a new type of regularity we call edge-girth-regularity. An edge-girth-regular ( v , k , g , λ ) -graph Γ is a k -regular graph of order v and girth g in which every edge is contained in λ distinct g -cycles.
Robert Jajcay, G. Kiss, Stefko Miklavic
semanticscholar +1 more source
We consider a new type of regularity we call edge-girth-regularity. An edge-girth-regular ( v , k , g , λ ) -graph Γ is a k -regular graph of order v and girth g in which every edge is contained in λ distinct g -cycles.
Robert Jajcay, G. Kiss, Stefko Miklavic
semanticscholar +1 more source

