The B-Domatic Number of a Graph

Discussiones Mathematicae Graph Theory

Favaron Odile¹ 

[1] LRI, UMR 8623, University Paris-Sud and CNRS F-91405 Orsay cedex, France;

关键词: domatic number;    adomatic number;    b-domatic number;    bchromatic number;    idomatic number;    partition;   

DOI  :  10.7151/dmgt.1709

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown