Temat: domatic partition - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Skocz do pozycji: 2.

Tytuł:: The b-Domatic Number of a Graph
Autorzy:: Favaron, Odile
Powiązania:: https://bibliotekanauki.pl/articles/30098013.pdf
Data publikacji:: 2013-09-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: domatic number
adomatic number
b-domatic number
bchromatic number
idomatic number
partition
Opis:: Besides the classical chromatic and achromatic numbers of a graph related to minimum or minimal vertex partitions into independent sets, the b-chromatic number was introduced in 1998 thanks to an alternative definition of the minimality of such partitions. When independent sets are replaced by dominating sets, the parameters corresponding to the chromatic and achromatic numbers are the domatic and adomatic numbers $d(G)$ and $ad(G)$. We introduce the b-domatic number $bd(G)$ as the counterpart of the b-chromatic number by giving an alternative definition of the maximality of a partition into dominating sets. We initiate the study of $bd(G)$ by giving some properties and examples.
Źródło:: Discussiones Mathematicae Graph Theory; 2013, 33, 4; 747-757
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Partitioning a graph into a dominating set, a total dominating set, and something else
Autorzy:: Henning, Michael
Löwenstein, Christian
Rautenbach, Dieter
Powiązania:: https://bibliotekanauki.pl/articles/744065.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: domination
total domination
domatic number
vertex partition
Petersen graph
Opis:: A recent result of Henning and Southey (A note on graphs with disjoint dominating and total dominating set, Ars Comb. 89 (2008), 159-162) implies that every connected graph of minimum degree at least three has a dominating set D and a total dominating set T which are disjoint. We show that the Petersen graph is the only such graph for which D∪T necessarily contains all vertices of the graph.
Źródło:: Discussiones Mathematicae Graph Theory; 2010, 30, 4; 563-574
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja