نتایج جستجو برای: weight g
تعداد نتایج: 750463 فیلتر نتایج به سال:
abstractin order to evaluate the effect of vermicompost and humic acid on quantitative and qualitative traits of sod turf, a factorial experiment based on completely randomized design with three replications was established in research farm in shahrekord university. treatments were vermicompost (zero, 5, 10 and 15 v/v percent) and humic acid (zero, 150 and 250 g/m2), respectively. some traits s...
Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin N(v)}f(x)ge 0$ for each $vin V(G)$, where $N(v)$ is the open neighborhood of $v$, and (ii) every vertex $u$ for which $f(u...
Variation in the number, total weight, mean individual weight and minimum individual weight of live pups at first and second litter were studied in hemiovariectomized (H = 54 does) and normal (N = 55 does) rabbit does. The total number of implanted embryos in 25 unoperated (N) and 54 hemiovariectomized (H) does were recorded by laparoscopy on the 12th day of their second pregnancy. The total nu...
We evaluated the protein quality of organic and transgenic soy fed to rats throughout life. Thirty female Wistar rats were divided into three groups (N = 10): organic soy group (OSG) receiving organic soy-based diet, genetically modified soy group (GMSG) receiving transgenic soy-based diet, and a control group (CG) receiving casein-based diet. All animals received water and isocaloric diet (10%...
A total-weighting of a graph G = (V,E) is a mapping f which assigns to each element y ∈ V ∪ E a real number f(y) as the weight of y. A total-weighting f of G is proper if the colouring φf of the vertices of G defined as φf (v) = f(v) + ∑ e∋v f(e) is a proper colouring of G, i.e., φf (v) ̸= φf (u) for any edge uv. For positive integers k and k′, a graph G is called (k, k′)-total-weight-choosable ...
An independent set (or a stable set) in a graph G is a subset of pairwise nonadjacent vertices of G. An independent set of G is maximal if it is not properly contained in any other independent set of G. The Maximum-Weight Independent Set (WIS) problem is the following: Given a graphG = (V,E) and a weight function w on V , determine an independent set of G of maximum weight. Let αw(G) denote the...
Young growing rats weighing approximately 83 g were fed on diets containing kidney bean (Phaseolus vulgaris) lectin (phytohaemagglutinin, PHA) in the range of 0-0.45 g/kg body weight for 10 d to ascertain whether there was a minimum dose below which the lectin had no significant effect on body and skeletal muscle weights in comparison with pair-fed lectin-free controls. Averaged over all experi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید