# 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… (More)
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A signed Roman dominating function (SRDF) on a graph G is a function f : V (G) → {−1, 1, 2} such that u∈N [v] f(u) ≥ 1 for every… (More)
Is this relevant?
2012
2012
• Discussiones Mathematicae Graph Theory
• 2012
For a positive integer k, a total {k}-dominating function of a digraph D is a function f from the vertex set V (D) to the set {0… (More)
Is this relevant?
2011
2011
Let k be a positive integer. A Roman k-dominating function on a graph G is a labelling f : V (G) −→ {0, 1, 2} such that every… (More)
Is this relevant?
2010
2010
• Appl. Math. Lett.
• 2010
A Roman dominating function on a graph G is a labeling f : V (G) −→ {0, 1, 2} such that every vertex with label 0 has a neighbor… (More)
Is this relevant?
2006
2006
• Proceedings IEEE INFOCOM . 25TH IEEE…
• 2006
We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while… (More)
• • • • • Is this relevant?
Highly Cited
2000
Highly Cited
2000
• STOC
• 2000
The domatic number problem is that of partitioning the vertices of a graph into the maximum number of disjoint dominating sets… (More)
• Is this relevant?
1998
1998
• Discrete Mathematics
• 1998
A subset D of the vertex set of a graph G is called a dominating set if each vertex of G is either in D or adjacent to some… (More)
Is this relevant?
1994
1994
A dominating set of a graph G =( P’, E) is a subset D of Vsuch that every vertex not in D is adjacent to some vertex in D. The… (More)
• • Is this relevant?
1994
1994
• Inf. Process. Lett.
• 1994
An extremely simple, linear time algorithm is given for constructing a domatic partition in totally balanced hypergraphs. This… (More)
• Is this relevant?
1988
1988
A dominatmg set of a graph G is a subset S of the nodes such that every uode of G is either in S or adjacent to some node in S… (More)
• • Is this relevant?