نتایج جستجو برای: k domatic number

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

Journal: :Journal of Approximation Theory 2000

Journal: :Discussiones Mathematicae Graph Theory 2015

Journal: :Journal of Combinatorial Theory, Series A 1980

Journal: :Discrete Mathematics, Algorithms and Applications 2020

Bahalo, Z. , Barzegar, R., Ghasemi Ghehsareh, M.,

To investigate the effects of nutrient-solution concentrations of potassium (K) and calcium (Ca), as well as different ratios of K/Ca, on growth and flowering of lisianthus (Eustoma grandiflorum) under soilless culture conditions, a factorial experiment was conducted with two factors including two K levels (300 and 400 mg/L) and three Ca levels (80, 100 and 160 mg/L). Results showed that K= 400...

2010
Pelin Günç ErGöNül Cevdet NErGiz Celal Bayar

Ergönül P.G., Nergiz C. (2010): Determination of organic acids in olive fruit by HPLC. Czech J. Food Sci., 28: 202–205. Organic acids (oxalic, citric, malic, and succinic) contents of Domat, Memecik and Uslu varieties of olives grown in Turkey were investigated using HPLC method. Organic acids were extracted from olives with water-methanol mixture solution 75:25 (v/v) and were analysed through ...

‎In this paper‎, ‎we investigate the number of 1-factors of a‎ ‎generalized Petersen graph $P(N,k)$ and get a lower bound for the‎ ‎number of 1-factors of $P(N,k)$ as $k$ is odd‎, ‎which shows that the‎ ‎number of 1-factors of $P(N,k)$ is exponential in this case and‎ ‎confirms a conjecture due to Lovász and Plummer (Ann‎. ‎New York Acad‎. ‎Sci‎. ‎576(2006)‎, ‎no‎. ‎1‎, ‎389-398).

Journal: :journal of heat and mass transfer research(jhmtr) 2014
ali sarreshtedari alireza zamani aghaee

the thermo-hydraulic behavior of the air flow over a two dimensional ribbed channel wasnumerically investigated in various rib-width ratio configurations (b/h=0.5-1.75) atdifferent reynolds numbers, ranging from 6000 to 18000. the capability of differentturbulence models, including standard k-ε, rng k-ε, standard k-ω, and sst k-ω, inpredicting the heat transfer rate was compared with the experi...

Journal: :Random Struct. Algorithms 2003
Béla Bollobás Graham R. Brightwell

We study the number SAT(k;n) of Boolean functions of n variables that can be expressed by a k-SAT formula. Equivalently, we study the number of subsets of the n-cube 2n that can be represented as the union of (n− k)-subcubes. In [3] the authors and Imre Leader studied SAT(k;n) for k ≤ n/2, with emphasis on the case k = 2. Here, we prove bounds on SAT(k;n) for k ≥ n/2; we see a variety of differ...

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

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