b-Domatic number of graph products

Session : GR / Graphes
Jeudi 11 février 15:00 - 16:40 Salle : RP13
Benatallah Mohammed et Ikhlef Eschouf Noureddine

A partition of V (G), all of whose classes are dominating sets in G, is called a b-domatic partition of G. The minimal number of classes of a b-domatic partition of G is called the b-domatic number of G. In this paper we explore the bounds for the b-domatic numbers of the Cartesian product, the strong product and the join of two graphs. The bonds are the best possible in the sense that there exist examples for which equalities are attained

Mots clés : domatic number, b-domatic number, graph products