Induced-paired domatic numbers of graphs
Bohdan Zelinka (2002)
Mathematica Bohemica
Similarity:
A subset of the vertex set of a graph is called dominating in , if each vertex of either is in , or is adjacent to a vertex of . If moreover the subgraph of induced by is regular of degree 1, then is called an induced-paired dominating set in . A partition of , each of whose classes is an induced-paired dominating set in , is called an induced-paired domatic partition of . The maximum number of classes of an induced-paired domatic partition of is the induced-paired...