Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,608,921 papers from all fields of science
Search
Sign In
Create Free Account
Domatic number
Known as:
Domat
, Domatic number problem
, Domatic partition
The domatic number is the maximum size of a domatic partition, that is, the maximum number of disjoint dominating sets. The graph in the figure has…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Approximation algorithm
Clique (graph theory)
Complement graph
Decision problem
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Fatty Acid Profile and Mineral Content of Commercial Table Olives from Turkey
V. Uylaşer
,
G. Yıldız
2013
Corpus ID: 56068916
In this study, five different types of commercial table olive: Domat, Kalamata, Edremit (green), Edremit (black) and Gemlik, from…
Expand
2013
2013
Hacia un concepto de inmisiones en el Derecho chileno
Carlos Felipe Amunátegui Perelló
2013
Corpus ID: 143987789
El presente artIculo intenta elaborar un concepto de inmisiones valido para el Derecho chileno, tomando en consideracion la…
Expand
2012
2012
Signed total (k, k)-domatic number of digraphs
S. Sheikholeslami
,
L. Volkmann
2012
Corpus ID: 120857373
Let D be a finite and simple digraph with vertex set V(D), and let f: V(D) → {−1, 1} be a two-valued function. If k ≥ 1 is an…
Expand
2010
2010
Signed (k, k)-domatic number of a graph
S. Sheikholeslami
,
L. Volkmann
2010
Corpus ID: 16890296
Let G be a finite and simple graph with vertex set V (G), and let f: V (G)→ {−1, 1} be a two-valued function. If k > 1 is an…
Expand
2010
2010
Signed total (k, k)-domatic number of a graph
S. Sheikholeslami
,
L. Volkmann
2010
Corpus ID: 14412020
Let G be a finite and simple graph with vertex set V (G), and let f : V (G) → {−1, 1} be a two-valued function. If k ≥ 1 is an…
Expand
2010
2010
Singed Total Domatic Number of a Graph
H. B. Walikar
,
Shailaja S. Shirkol
,
Kishori P. Narayankar
2010
Corpus ID: 117748058
Let G be a flnite and simple graph with vertex set V (G), k ‚ 1 an integer and let f : V (G) ! fik;k i1;¢¢¢ ;i1;1;¢¢¢ ;k i1;kg be…
Expand
2008
2008
Domatic number of graph products
M. Kijewska
2008
Corpus ID: 17358772
A partition of V (G), all of whose classes are dominating sets in G, is called a domatic partition of G. The maximum number of…
Expand
2005
2005
THE EFFECTS OF THE DIFFERENT DOSES OF IBA (INDOL BUTRIC ACID) ON THE ROOTING PERFORMANCES IN THE REPRODUCTION OF "GEMLIK" AND "DOMAT" OLIVE TREES BY USING THE GREEN TWIG PROCEDURE IN THE ECOLOGY OF…
Seyhan Özelbaykal
,
Ö. Gezerel
2005
Corpus ID: 85679715
The effects of the different doses (0, 2000, 4000 and 6000 ppm) of IBA (Indol Butric Acid) on the rooting performances in the…
Expand
2004
2004
Domat Türü Yeşil Zeytinin Tatlandırılması Üzerine bir Araştırma
Inci Durucasu
2004
Corpus ID: 101070739
Bu calismada Ege bolgesinde yetisen domat yesil zeytin cesidi, kasim ayinin ilk haftasinda hasat edilerek cizilmis ve cesitli…
Expand
2001
2001
INDUCED-PAIRED DOMATIC NUMBERS OF GRAPHS
D. Studer
,
T. Haynes
,
L. M. Lawson
2001
Corpus ID: 912356
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…
Expand