Results 151 to 160 of about 4,520 (257)
Regular totally domatically full graphs
Discrete Mathematics, 1990 AbstractThe paper studies bipartite undirected graphs and directed graphs which are regular and totally domitically full.
openaire +2 more sources
Effect of Sakarya Akgöl Peat on Quality Parameters of Tomato
Trakya University Journal of Natural Sciences, 2015 Tomato is the first ranking plant in greenhouse production both in Turkey and throughout the worldand various media are used for its cultivation. Peat is one of the most preferred media especially for its physical properties. In this study, the potential
Nuray ÇİÇEK ATİKMEN, Cihat KÜTÜK
doaj
Taha Toros Arşivi, Dosya No: 112-Lokantalarİstanbul Kalkınma Ajansı (TR10/14/YEN/0033) İstanbul Development Agency (TR10/14/YEN ...
Ünsal, Artun
core
A masterpiece by Sinan:Süleymaniye Camii [PDF]
, 1993 Taha Toros Arşivi, Dosya No: 102-Camilerİstanbul Kalkınma Ajansı (TR10/14/YEN/0033) İstanbul Development Agency (TR10/14/YEN ...
Rengin, Cana
core
An Exact 2.9416^n Algorithm for the Three Domatic Number Problem [PDF]
arXiv, 2005 The three domatic number problem asks whether a given undirected graph can be partitioned into at least three dominating sets, i.e., sets whose closed neighborhood equals the vertex set of the graph. Since this problem is NP-complete, no polynomial-time algorithm is known for it.
arxiv
Taha Toros Arşivi, Dosya No: 35- Nişantaşı-Maçkaİstanbul Kalkınma Ajansı (TR10/14/YEN/0033) İstanbul Development Agency (TR10/14/YEN ...
Orhun, Ceylan
core
The domatic number of regular and almost regular graphs [PDF]
arXiv, 2001 The domatic number of a graph $G$, denoted $dom(G)$, is the maximum possible cardinality of a family of disjoint sets of vertices of $G$, each set being a dominating set of $G$. It is well known that every graph without isolated vertices has $dom(G) \geq 2$. For every $k$, it is known that there are graphs with minimum degree at least $k$ and with $dom(
arxiv
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
Bounds on the signed domatic number
Applied Mathematics Letters, 2011 Abstract Let G be a finite and simple graph with the vertex set V ( G ) , and let f : V ( G ) → { − 1 , 1 } be a two-valued function. If ∑ x ∈ N [ v ] f ( x ) ≥ 1 for each v ∈ V ( G ) , where N [ v ] is the closed neighborhood of v , then f is a signed
openaire +2 more sources