Results 81 to 90 of about 110 (106)

Ekim Makinası Sıra Üzeri Tohum Dağılımının Görüntü işleme Yöntemi İle Belirlenmesi

Journal of Agricultural Sciences, 2000
Ekim mavnalarından beklenen önemli işlevsel özelliklerden birisi sıra üzeri tohum dağılımının düzgün olmasıdır. Bu nedenle ekim makinalarında sıra üzeri dağılım düzgünlüğünün belirlenmesi gerekmektedir Laboratuvarda yapışkan bant düzeni yardımıyla sıra ...
İknur Göknur Dursun
doaj  

The Effects of Peat and Sand Amended Spent Mushroom Compost on Growing of Tomato

Journal of Agricultural Sciences, 1998
In this study, the effects of peat and sand amended spent mushroom compcst SMC on grov ı ing of tomato Lycopersicon escelantum Mili. cv.H 2274. were investigated, and 100% Peat and SMC, mixtures of SMC with 25%, 50%, 75% Peat, and 50% SMC + 25% Peat
Gökhan Çaycı, Abdullah Bara, Damla Bender   +2 more
doaj  

Antioxidant Activity of Different Phenolic-Rich Fractions Obtained From Peels of Turkish Dark Purple Eggplant. [PDF]

Food Sci Nutr
Djouadi A, Yılmazer H, Djouadi A, Çakır B.   +3 more
europepmc   +1 more source

An Ethnobotanical Study in Kırşehir (Türkiye). [PDF]

Plants (Basel)
Emre G, Şenkardeş İ, İşcan K, Evcimen O, Yılmaz İ, Tugay O.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Domatic and Total Domatic Numbers of Cartesian Products of Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2023
A domatic \(k\)-coloring of a simple, undirected graph \(G\) is an assignment of \(k\) colors to the vertices of \(G\) such that each vertex contains vertices of all \(k\) colors in its closed neighborhood. The domatic number of \(G\), denoted \(d(G)\), is the maximum \(k\) for which \(G\) has a domatic \(k\)-coloring. A total domatic \(k\)-coloring is
P. Francis, Deepak Rajendraprasad
openaire   +2 more sources

Approximating the domatic number

Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a graph into the maximum number of disjoint dominating sets. Let n denote the number of vertices, δ the minimum degree, and ∆ the maximum degree.
Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz   +2 more
openaire   +1 more source

Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph

2020
The fractional domatic number of a graph G is the maximum ratio \(|\mathcal {F}|/m(\mathcal {F})\) over all families \(\mathcal {F}\) of dominating sets of G, where \(m(\mathcal {F})\) denotes the maximum number of times any particular vertex appears in \(\mathcal {F}\).
Wayne Goddard, Michael A. Henning
openaire   +1 more source

The k-domatic number of a graph

Czechoslovak Mathematical Journal, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kämmerling, Karsten, Volkmann, Lutz
openaire   +1 more source

GRAPHS THAT ARE NOT DOMATICALLY CO-CRITICAL

Discrete Mathematics, Algorithms and Applications, 2011
A graph G is said to be domatically co-critical, if d(G + uv) > d(G), for any two non-adjacent vertices u, v in G. In this paper we present the set of graphs that are not domatically co-critical.
Hanumappa B. Walikar, L. Sudershan Reddy
openaire   +1 more source

On the domatic number of internal graphs

Information Processing Letters, 1988
A dominating set of a graph G is a subset S of the nodes such that every node of G is either in S or adjacent to some node in S. The domatic number of G is the size of a maximum cardinality partition of the nodes into dominating sets. We present an \(O(n^{2.5})\) time algorithm for finding the domatic number, as well as the desired partition, of an ...
openaire   +2 more sources