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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

Cette communication s'interesse a la genese et a la diffusion de la notion de « metiers en tension » comme operateur descriptif…

2013

In this study, five different types of commercial table olive: Domat, Kalamata, Edremit (green), Edremit (black) and Gemlik, from…

2012

This article deals with partitioning the vertex set V(G) into as many disjoint subsets, each being a majority dominating set with…

2010

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…

2010

For a random geometric graph G(n, r) of minimum degree δ, we introduce an efficient algorithm for selecting (δ + 1) backbones…

2010

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…

2007

A dominating set $S$ in a graph $G$ is a tree dominating set of $G$ if the subgraph induced by $S$ is a tree. The tree…

2005

The effects of the different doses (0, 2000, 4000 and 6000 ppm) of IBA (Indol Butric Acid) on the rooting performances in the…

1991

The total edge-domatic number of a graph is introduced as an edge analogue of the total domatic number. Its values are studied…

1990

A set of vertices D is a dominating set of a graph $G = ( V,E )$ if every vertex in $V - D$ is adjacent to a vertex in D. The…