نتایج جستجو برای: paunch girth

تعداد نتایج: 2962  

Journal: :transactions on combinatorics 2012
mohammad gholami fahime sadat mostafaiee

‎s‎. ‎kim et al‎. ‎have been analyzed the girth of some algebraically‎ ‎structured quasi-cyclic (qc) low-density parity-check (ldpc)‎ ‎codes‎, ‎i.e‎. ‎tanner $(3,5)$ of length $5p$‎, ‎where $p$ is a prime of‎ ‎the form $15m+1$‎. ‎in this paper‎, ‎by extension this method to‎ ‎tanner $(3,7)$ codes of length $7p$‎, ‎where $p$ is a prime of the‎ ‎form $21m‎+ ‎1$‎, ‎the girth values of tanner $(3,7...

Journal: :Theor. Comput. Sci. 2015
Guillaume Guégan Pascal Ochem

We consider the complexity of oriented homomorphism and two of its variants, namely strong oriented homomorphism and pushable homomorphism, for planar graphs with large girth. In each case, we consider the smallest target graph such that the corresponding homomorphism is NP-complete. These target graphs T4, T5, and T6 have 4, 5, and 6 vertices, respectively. For i ∈ {4, 5, 6} and for every g, w...

Journal: :J. Comb. Theory, Ser. B 2001
Anna Galluccio Luis A. Goddyn Pavol Hell

Let H be a xed graph. We show that any H-minor free graph of high enough girth has a circular-chromatic number arbitrarily close to two. Equivalently, such graphs have homomorphisms into a large odd circuit. In particular, graphs of high girth and of bounded genus or bounded tree width are \nearly bipartite" in this sense. For example, any planar graph of girth at least 16 admits a homomorphism...

2005
LISA HERNÁNDEZ XIAO - SONG LIN

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1 vertices. The number of valence 1 vertices of the trees is called the girth of the knot diagram. The classification problem of knots admitting girth 2 and 3 diagra...

2015
Xi Wang Xiaoming Tao Raymond C. H. So

As one of the convenient and noninvasive sensing approaches, the automatic limb girth measurement has been applied to detect intention behind human motion from muscle deformation. The sensing validity has been elaborated by preliminary researches but still need more fundamental studies, especially on kinetic contraction modes. Based on the novel fabric strain sensors, a soft and smart limb girt...

Journal: :British journal of sports medicine 2000
J Bourgois A L Claessens M Janssens B Van Renterghem R Loos M Thomis R Philippaerts J Lefevre J Vrijens

During the 1997 Federation Internationale des Sociétés d'Aviron (FISA) World Junior Rowing Championships, the anthropometric characteristics of 245 female junior rowers aged 17.5 +/- 0.8 years (mean +/- s) were assessed. Twenty-seven body dimensions (body mass, 6 heights or lengths, 4 breadths, 10 girths and 6 skinfolds) were measured in total. The elite female junior rowers were taller (174.5 ...

Journal: :Eur. J. Comb. 2014
Marthe Bonamy Benjamin Lévêque Alexandre Pinlou

We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different colors. Borodin et al. proved in 2004 and 2008 that the squares of planar graphs of girth at least seven and sufficiently large maximum degree ∆ are list (∆ + 1)-...

Journal: :Asia Pacific journal of clinical nutrition 2007
Michael Gracey Valerie Burke David D Martin Robert J Johnston Timothy Jones Elizabeth A Davis

OBJECTIVE To evaluate waist-to-height ratio (WTHR), waist girth and body mass index (BMI) as predictors of cardiovascular risk factors in Australian Aborigines. DESIGN Indices were examined as predictors of mean blood pressures (BP), blood lipids, glucose, insulin and as predictors of hypertension, decreased HDL-cholesterol, elevated glucose and type 2 diabetes. SETTING Aboriginal communiti...

Journal: :Electr. J. Comb. 1998
Norman Biggs

The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer μ0(g), the smallest number of vertices for which a cubic graph with girth at least g exists, and furthermore, the minimum value μ0(g) is attained by a graph whose girth is exactly g. The values of μ0(g) when 3 ≤ g ≤ 8 have been known for over thirty y...

Journal: :Clinical EEG 1998
R B Sangal

Let us take two groups of, say, 310 people each, drawn from the same population. Now let usdraw two large circles. Withineachcircle, let usdraw31 equallyspacedsmallercir-cles, sothat,foreachsmallcircleinonelargecircle, thereisan equivalently situated small circle in the other large circle. Now we instruct the 31 0 people to form self-assorted sub-groupsof lopeopleeach, andoccupyoneofthesmallcir...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید