Results 121 to 130 of about 4,520 (257)

Silifke İlçesi’nde Serada Domates Yetiştiren İşletmelerin Ekonomik Performansları ve Birim Ürün Maliyetleri

open access: yesJournal of Agricultural Sciences, 2005
Mersin İli Silifke İlçesi’nin araştırma alanı olarak seçildiği bu araştırmada, yılda bir ve iki kez domates yetiştiren plastik sera işletmelerinin ekonomik performansı ve üretim maliyetlerinin saptanması amaçlanmıştır.
Sevgi Rad, Garip Yarşı
doaj  

Mekanik Hasarsız Çarpma Tekniğiyle Domatesin Sertliğine Göre Sınıflandırılması

open access: yesJournal of Agricultural Sciences, 2015
Bu çalışmada, mekanik hasarsız çarpma tekniği kullanılarak domatesin sertliklerine göre sınıflandırılması incelenmiştir. Denemelerde Bandita F1 domates çeşidi kullanılmıştır.
Kubilay Vursavuş   +2 more
doaj   +1 more source

The k-Tuple Domatic Number of a Graph [PDF]

open access: yesCaspian Journal of Mathematical Sciences, Volume 2, Issue 2 (2013) 105-112, 2011
For every positive integer $k$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple dominating set of $G$ if every vertex of $V-S$ is adjacent to least $k$ vertices and every vertex of $S$ is adjacent to least $k-1$ vertices in $S$. The minimum cardinality of a $k$-tuple dominating set of $G$ is the $k$-tuple domination number of $G$. When $k=1$,
arxiv  

Cubic Graphs with Total Domatic Number at Least Two [PDF]

open access: yesarXiv, 2015
Let $G$ be a graph. A total dominating set of $G$ is a set $S$ of vertices of $G$ such that every vertex is adjacent to at least one vertex in $S$. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of $G$.
arxiv  

Strong domatic number of a graph

open access: yesDiscrete Mathematics, Algorithms and Applications
A set [Formula: see text] of vertices of a simple graph [Formula: see text] is a strong dominating set, if for every vertex [Formula: see text] there is a vertex [Formula: see text] with [Formula: see text] and [Formula: see text]. The strong domination number [Formula: see text] is defined as the minimum cardinality of a strong dominating set.
Nima Ghanbari, Saeid Alikhani
openaire   +2 more sources

Is there a survival processing effect in metacognition? [PDF]

open access: yesPsychol Res, 2023
Çabuk D   +3 more
europepmc   +1 more source

Effects of plant growth promoting bacteria (PGPB) on yield, growth and nutrient contents of organically grown strawberry [PDF]

open access: yes, 2009
The effects of plant growth promoting bacteria (PGPB) on the fruit yield, growth and nutrient element content of strawberry cv. Fern were investigated under organic growing conditions between 2006 and 2008.
Donmez, M.Figen   +5 more
core   +1 more source

Epidemiological Influences and Requirements of Global Childhood Obesity Research. [PDF]

open access: yesObes Facts, 2021
Klingelhöfer D   +4 more
europepmc   +1 more source

Gecikmeli... [PDF]

open access: yes, 1987
Taha Toros Arşivi, Dosya No: 37-Fahrettin Kerim Gökay.
Arpad, Burhan
core  

The double Roman domatic number of a digraph

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A double Roman dominating function on a digraph D with vertex set V (D) is defined in [G. Hao, X. Chen and L. Volkmann, Double Roman domination in digraphs, Bull. Malays. Math. Sci. Soc. (2017).] as a function f : V (D) → {0, 1, 2, 3} having the property that if f(v) = 0, then the vertex v must have at least two in-neighbors assigned 2 under f or one ...
openaire   +3 more sources

Home - About - Disclaimer - Privacy