Results 131 to 140 of about 2,815 (148)
Some of the next articles are maybe not open access.
The k-domatic number of a graph
Czechoslovak Mathematical Journal, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kämmerling, Karsten, Volkmann, Lutz
openaire +1 more source
Domatic partitions of computable graphs
Archive for Mathematical Logic, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew Jura +2 more
openaire +2 more sources
GRAPHS THAT ARE NOT DOMATICALLY CO-CRITICAL
Discrete Mathematics, Algorithms and Applications, 2011A 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
Approximating theDomatic Number
SIAM Journal on Computing, 2002Summary: 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, \(\delta\) the minimum degree, and \(\Delta\) the maximum degree. We
Uriel Feige +3 more
openaire +1 more source
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 +3 more
openaire +1 more source
Yelderem Akhoundnejad +3 more
openaire +1 more source
The domatic numbers of factors of graphs
Ars Comb., 2000A 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 +2 more sources
The domatic number of regular graphs.
Ars Comb., 2004A 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 +2 more sources