Results 91 to 100 of about 110 (106)

On the Roman {2}-domatic number of graphs

Discrete Mathematics, Algorithms and Applications, 2020
Let [Formula: see text] be a graph. A Roman[Formula: see text]-dominating function [Formula: see text] has the property that for every vertex [Formula: see text] with [Formula: see text], either [Formula: see text] is adjacent to a vertex assigned [Formula: see text] under [Formula: see text], or [Formula: see text] is adjacent to at least two ...
Azam Giahtazeh, Hamidreza Maimani, Ali Iranmanesh   +2 more
openaire   +2 more sources

The {k}-domatic number of a graph

Aequationes mathematicae, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meierling, D., Sheikholeslami, S. M., Volkmann, L.   +2 more
openaire   +1 more source

Domatic partitions of computable graphs

Archive for Mathematical Logic, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew Jura, Oscar Levin, Tyler Markkanen   +2 more
openaire   +1 more source

The Signed Edge-Domatic Number of a Graph

Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiang-Jun Li, Jun-Ming Xu 0001
openaire   +2 more sources

Domates Yetiştiriciliği

Domates, dünyada en yaygın yetiştirilen ve tüketilen sebzelerden biri olup hem sofralık hem de sanayi tipi üretimiyle stratejik öneme sahiptir. Anavatanı Güney Amerika olan domates, 16. yüzyılda Avrupa’ya, 19. yüzyılda ise Türkiye’ye girmiştir. Günümüzde Çin, Hindistan ve Türkiye dünya üretiminde ilk sıralarda yer almakta, Türkiye yüksek verimliliğiyle
Yelderem Akhoundnejad, Hayriye Yıldız Daşgan, Sultan Dere, Pakize Gök Güler   +3 more
openaire   +1 more source

The domatic number of regular graphs.

Ars Comb., 2004
A set \(S\) of vertices of a graph \(G\) is {dominating} if each vertex is either contained in \(S\) or has at least one neighbor in \(S\). The {domatic number} of a graph \(G\) is the maximum number of dominating sets into which the vertex set of \(G\) can be partitioned.
Peter Dankelmann, Neil J. Calkin
openaire   +1 more source

The domatic numbers of factors of graphs

Ars Comb., 2000
A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(D\), or is adjacent to a vertex of \(D\). The maximum number of classes of a partition of \(V(G)\) into dominating sets is the domatic number \(d(G)\) of \(G\).
Haynes, Teresa W., Henning, Michael A.
openaire   +1 more source

Domat, Jean

2022
openaire   +1 more source

domatic

2009
openaire   +1 more source

Domates Fidesi Üretimi ve Domates Çeşitleri

2013
SARIYER, TOLGA, ÖZTOKAT KUZUCU, CANAN
openaire   +1 more source