Results 111 to 120 of about 4,520 (257)
The b-domatic number of a graph
Discussiones Mathematicae Graph Theory, 2013 Besides the classical chromatic and achromatic numbers of a graph related to minimum or minimal vertex partitions into independent sets, the b-chromatic number was introduced in 1998 thanks to an alternative definition of the minimality of such partitions.
openaire +3 more sources
Süleyman Demirel Üniversitesi Fen-Edebiyat Fakültesi Fen Dergisi, 2017 Geniş bir konukçu dizisine sahip Tuta absoluta (Meyrick) (Lepidoptera: Gelechiidae), domatesin yanı sıra patates, patlıcan, biber, fasulye gibi birçok sebze ve ayrıca köpek üzümü ile şeytan elması gibi yabancı otlarda da beslenmektedir.
Alime BAYINDIR, Ali Kemal BİRGÜCÜ
doaj
Journal of Agricultural Sciences, 2000 Tomato Lycopersicon esculentum MIK cultivar Moneymaker, was grown hydroponically in controlled temperature C.T. room for 25 days to investigate relationships between phosphorus concentration in leaves and roots with phosphatase enzyme activity in ...
Cengiz Kaya, David Hıggs, Agneta Burton
doaj +1 more source
Turkish Journal of Agriculture: Food Science and Technology, 2020 Tarımda seracılık yeri ve önemi açısından yükselen bir değerdir. Seracılık, tarım sektörüne ilgi duymayan girişimci ve yatırımcıların dahi ilgisini çekmeyi başarmıştır.
Osman Karkacier
doaj +1 more source
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem [PDF]
arXiv, 2002 We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of computer networks, is the problem of partitioning a given graph into a maximum number of disjoint dominating sets. This number is called the domatic number of the graph.
arxiv
Connected Domatic Packings in Node-capacitated Graphs [PDF]
arXiv, 2013 A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. A dominating set is connected if the subgraph induced by its vertices is connected. The connected domatic partition problem asks for a partition of the nodes into connected dominating sets. The connected domatic number of a graph is the size of a
arxiv
Ercüment Batanay'ın çalmadığı assolist yok [PDF]
, 1993 Taha Toros Arşivi, Dosya Adı: Müzisyenler. Not: Gazetenin “40 Yıl Önceki Gece Hayatımız” köşesinde yayımlanmıştır.İstanbul Kalkınma Ajansı (TR10/14/YEN/0033) İstanbul Development Agency (TR10/14/YEN ...
Arpaçay, Ergün
core
Effects of plant growth promoting rhizobacteria (PGPR) on yield,growth and nutrient contents in organically growing raspberry [PDF]
, 2006 During 2003 and 2005, plant growth promoting effects of two Bacillus strains OSU-142 (N2-fixing) and M3 (N2-fixing and phosphate solubilizing) were tested alone or in combinations on organically grown primocane fruiting raspberry (cv.
Ercisli, Sezai +4 more
core +1 more source
The Roman (k,k)-domatic number of a graph [PDF]
arXiv, 2020 Let $k$ be a positive integer. A {\em Roman $k$-dominating function} on a graph $G$ is a labeling $f:V (G)\longrightarrow \{0, 1, 2\}$ such that every vertex with label 0 has at least $k$ neighbors with label 2. A set $\{f_1,f_2,\ldots,f_d\}$ of distinct Roman $k$-dominating functions on $G$ with the property that $\sum_{i=1}^df_i(v)\le 2k$ for each $v\
arxiv
Signed star domatic number of a graph
Discrete Applied Mathematics, 2010 AbstractLet G be a simple graph without isolated vertices with vertex set V(G) and edge set E(G). A function f:E(G)⟶{−1,1} is said to be a signed star dominating function on G if ∑e∈E(v)f(e)≥1 for every vertex v of G, where E(v)={uv∈E(G)∣u∈N(v)}. A set {f1,f2,…,fd} of signed star dominating functions on G with the property that ∑i=1dfi(e)≤1 for each e ...
Arezoo N. Ghameshlou +3 more
openaire +2 more sources