Point-set domatic numbers of graphs
Bohdan Zelinka (1999)
Mathematica Bohemica
Similarity:
A subset of the vertex set of a graph is called point-set dominating, if for each subset there exists a vertex such that the subgraph of induced by is connected. The maximum number of classes of a partition of , all of whose classes are point-set dominating sets, is the point-set domatic number of . Its basic properties are studied in the paper.