- Tytuł:
- On the b -Domatic Number of Graphs
- Autorzy:
-
Benatallah, Mohammed
Ikhlef-Eschouf, Noureddine
Mihoubi, Miloud - Powiązania:
- https://bibliotekanauki.pl/articles/31343453.pdf
- Data publikacji:
- 2019-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
domatic partition
domatic number
b-domatic partition
b-domatic number - Opis:
- A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent to at least one vertex in S. A domatic partition of graph G is a partition of its vertex-set V into dominating sets. A domatic partition P of G is called b-domatic if no larger domatic partition of G can be obtained from P by transferring some vertices of some classes of P to form a new class. The minimum cardinality of a b-domatic partition of G is called the b-domatic number and is denoted by bd(G). In this paper, we explain some properties of b-domatic partitions, and we determine the b-domatic number of some families of graphs.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 2; 313-324
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł