Results 141 to 150 of about 4,520 (257)

Fenolik Bileşenler ve Bağırsak Bakterileri Arasında Karşılıklı Etkileşim

Turkish Journal of Agriculture: Food Science and Technology, 2018
Bağırsak bakteri popülasyonunu anaerobik bakteriler olan Clostridium, Bifidobacterium, Peptococcus, Eubacterium, Fusobacterium, Peptostreptococcus, Bacteroides, E.
Rabia Talay, Ümmügülsüm Erdoğan
doaj   +1 more source

MAKRO KİRLENMENİN MİKRO KİRLENMEYE ETKİSİ VE BUNA BAĞLI DEĞİŞEN BESLENME MODELLERİ [PDF]

, 2013
As the world population and industrialization increase, the toxicity of life on earth also increases. This toxicity that disturbs the ecosystem of nature, also leaks into human biosystems.
Bulbul, Miyase
core  

The domatic number of block-cactus graphs

Discrete Mathematics, 1998
Abstract A subset D of the vertex set of a graph G is called a dominating set if each vertex of G is either in D or adjacent to some vertex in D . The domatic number d ( G ) is defined as the maximum cardinality of a partition of the vertex set of G into dominating sets.
Dieter Rautenbach, Lutz Volkmann
openaire   +1 more source

Agricultural Chemical Use in Tomato Farming in Kazova Region of Tokat Province

Turkish Journal of Agriculture: Food Science and Technology, 2017
Pesticide uses in Kazova region of Tokat province were assessed in this study. Data were gathered through Simple Random Sampling method with questionnaires made with 72 agricultural enterprises.
Bilge Gözener, Murat Sayılı, Aysun Çağlar   +2 more
doaj   +1 more source

k-tuple total restrained domination and k-tuple total restrained domatic in graphs [PDF]

BUll. Iranian Math. Soc. Vol 40 (2014) No. 3 pp.751-763, 2011
Let $G$ be a graph of order $n$ and size $m$ and let $k\geq 1$ be an integer. A $k$-tuple total dominating set in $G$ is called a $k$-tuple total restrained dominating set of $G$ if each vertex $x\in V(G)-S$ is adjacent to at least $k$ vertices of $V(G)-S$.
arxiv  

The Italian domatic number of a digraph

Communications in Combinatorics and Optimization, 2019
An {\em Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function $f\colon V(D)\to \{0, 1, 2\}$ such that every vertex $v\in V(D)$ with $f(v)=0$ has at least two in-neighbors assigned 1 under $f$ or one in-neighbor $w$ with $f(w)=2$.
openaire   +3 more sources

Counting the Number of Domatic Partition of a Graph [PDF]

arXiv
A subset of vertices $S$ of a graph $G$ is a dominating set if every vertex in $V \setminus S$ has at least one neighbor in $S$. A domatic partition is a partition of the vertices of a graph $G$ into disjoint dominating sets. The domatic number $d(G)$ is the maximum size of a domatic partition.
arxiv  

First cohomology of pure mapping class groups of big genus one and zero surfaces [PDF]

arXiv, 2019
We prove that the first integral cohomology of pure mapping class groups of infinite type genus one surfaces is trivial. For genus zero surfaces we prove that not every homomorphism to $\mathbb{Z}$ factors through a sphere with finitely many punctures. In fact we get an uncountable family of such maps.
arxiv  

Le France [PDF]

Taha Toros Arşivi, Dosya No: 112-Lokantalarİstanbul Kalkınma Ajansı (TR10/14/YEN/0033) İstanbul Development Agency (TR10/14/YEN ...
Orhun, Ceylan
core  

Şehir mektuplarında yemek keyfiyeti [PDF]

, 1993
Taha Toros Arşivi, Dosya No: 96-Ahmet Rasimİstanbul Kalkınma Ajansı (TR10/14/YEN/0033) İstanbul Development Agency (TR10/14/YEN ...
Çizgen, Nevval
core